Bounds for Covering Codes over Large Alphabets

Let K_q(n,R) denote the minimum number of codewords in any q-ary code of length n and covering radius R. We collect lower and upper bounds for K_q(n,R) where 6 ≤ q ≤ 21 and R ≤ 3. For q ≤ 10, we consider lengths n ≤ 10, and for q ≥ 11, we consider n ≤ 8. This extends earlier results, which have been tabulated for 2 ≤ q ≤ 5. We survey known bounds and obtain some new results as well, also for s-surjective codes, which are closely related to covering codes and utilized in some of the constructions.AMS Classification: 94B75, 94B25, 94B65Gerzson Kéri - Supported in part by the Hungarian National Research Fund, Grant No. OTKA-T029572.Patric R. J. Östergård - Supported in part by the Academy of Finland, Grants No. 100500 and No. 202315.     

On the Minimum Size of Some Minihypers and Related Linear Codes

We denote by m_r,q(s) the minimum value of f for which an {f, _r-2+s ; r,q }-minihyper exists for r 3, 1 s q–1, where _j=(q^j+1–1)/(q–1). It is proved that m_3,q(s)=₁(₁+s) for many cases (e.g., for all q 4 when ) and that m_r,q(s) _r-1+s₁+q for 1 s q – 1,~q 3,~r 4. The nonexistence of some [n,k,n+s–q^k-2]_q codes attaining the Griesmer bound is given as an application.AMS classification: 94B27, 94B05, 51E22, 51E21     

Kernels and <Emphasis Type="Italic">p</Emphasis>-Kernels of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>-ary 1-Perfect Codes

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over as well as over the prime field , are established. Q-ary 1-perfect codes of length n=(q^m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.Communicated by: I.F. Blake     

Upper Bounds on the Dual Distance of BCH(255, k)

To obtain upper bounds on the distance of a binary linear code, many probabilistic algorithms have been proposed. The author presents a general variation to these algorithms, specific for cyclic codes, which is shown to be an improvement. As an example, the author optimizes Brouwer's algorithm to find the best upper bounds on the dual distance of BCH[255,k,d].     

A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays

In (Can J Math 51(2):326–346, 1999), Martin and Stinson provide a generalized MacWilliams identity for linear ordered orthogonal arrays and linear ordered codes (introduced by Rosenbloom and Tsfasman (Prob Inform Transm 33(1):45–52, 1997) as “codes for the m-metric”) using association schemes. We give an elementary proof of this generalized MacWilliams identity using group characters and use it to derive an explicit formula for the dual type distribution of a linear ordered code or orthogonal array.