Johnson bound

Known as: First Johnson bound, 1st Johnson bound, 2nd Johnson bound

In applied mathematics, the Johnson bound (named after Selmer Martin Johnson) is a limit on the size of error-correcting codes, as used in coding…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

The class of geometric orthogonal codes (GOCs) were introduced by Doty and Winslow (2016) for more robust macro-bonding in DNA…

2017

New constructions of 3-dimensional optical orthogonal codes are presented. In each case the codes have ideal autocorrelation a…

2013

In this paper, a construction of constant weight codes based on the unique decomposition of elements in lattices is presented…

2011

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme…

2010

The maximum size of a binary code is studied as a function of its length <i>n</i>, minimum distance <i>d</i>, and minimum…

Review

2009

Review

2009

(

2008

A central problem in coding theory is to determine $A_q(n,2e+1)$, the maximal cardinality of a $q$-ary code of length $n…

2007

A list decoding algorithm is designed for the first-order binary Reed-Muller codes of length n that reconstructs all codewords…

2005

2004

Some efficient constructions and bounds for 2-D optical orthogonal codes in which the spreading is carried out over both…