The Length of Primitive BCH Codes with Minimal Covering Radius

It is proved that the covering radius of a primitive binary BCH code of length q-1 and designed distance 2t+1, where is exactly 2t-1 (the minimum value possible). The bound for q is significantly lower than the one obtained by O. Moreno and C. J. Moreno [9].     

On the Covering Radius of Ternary Extremal Self-Dual Codes

In this paper, we investigate the covering radius of ternary extremal self-dual codes. The covering radii of all ternary extremal self-dual codes of lengths up to 20 were previously known. The complete coset weight distributions of the two inequivalent extremal self-dual codes of length 24 are determined. As a consequence, it is shown that every extremal ternary self-dual code of length up to 24 has covering radius which meets the Delsarte bound. The first example of a ternary extremal self-dual code with covering radius which does not meet the Delsarte bound is also found. It is worth mentioning that the found code is of length 32.     

New Constructions of Covering Codes

Coveringcode constructions obtaining new codes from starting ones weredeveloped during last years. In this work we propose new constructionsof such kind. New linear and nonlinear covering codes and aninfinite families of those are obtained with the help of constructionsproposed. A table of new upper bounds on the length functionis given.     

On Lower Bounds For Covering Codes

We study lower bounds on K(n,R), the minimum number of codewords of any binary code of length n such that the Hamming spheres of radius R with center at codewords cover the Hamming space . We generalize Honkala's idea toobtain further improvements only by using some simple observationsof Zhang's result. This leads to nineteen improvements of thelower bound on K(n,R) within the range of .     

New Quaternary Linear Codes with Covering Radius 2

A new quaternary linear code of length 19, codimension 5, and covering radius 2 is found in a computer search using tabu search, a local search heuristic. Starting from this code, which has some useful partitioning properties, different lengthening constructions are applied to get an infinite family of new, record-breaking quaternary codes of covering radius 2 and odd codimension. An algebraic construction of covering codes over alphabets of even characteristic is also given.     

The Covering Radius of Ternary Cyclic Codes with Length up to 25

The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated.     

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 Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tietäväinen lt:newu and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The upper bound on the information rate is an application of a shortening method of a code and is an analogue of the Shannon-Gallager-Berlekamp straight line bound on error probability. These results improve on the best presently known asymptotic upper bounds on minimum distance and covering radius of non-binary codes in certain intervals.     

Asymmetric Binary Covering Codes

An asymmetric binary covering code of length n and radius R is a subset of the n-cube Q_n such that every vector xQ_n can be obtained from some vector c by changing at most R 1's of c to 0's, where R is as small as possible. K⁺(n,R) is defined as the smallest size of such a code. We show K⁺(n,R)Θ(2ⁿ/n^R) for constant R, using an asymmetric sphere-covering bound and probabilistic methods. We show K⁺(n,n− )= +1 for constant coradius iff n ( +1)/2. These two results are extended to near-constant R and , respectively. Various bounds on K⁺ are given in terms of the total number of 0's or 1's in a minimal code. The dimension of a minimal asymmetric linear binary code ([n,R]⁺-code) is determined to be min{0,n−R}. We conclude by discussing open problems and techniques to compute explicit values for K⁺, giving a table of best-known bounds.     

一族Bloch函数的单叶半径与覆盖半径

研究了Bloch函数族B中的一个子族Bg,给出了Bg中函数的单叶半径.作为应用建立了Bg中函数的覆盖定理,从而刻画了Bg中函数的有关性质.     

Constructing Covering Codes with Given Automorphisms

Let K(n,r) denote the minimum cardinality of a binary covering code of length n and covering radius r. Constructions of covering codes give upper bounds on K(n,r). It is here shown how computer searches for covering codes can be sped up by requiring that the code has a given (not necessarily full) automorphism group. Tabu search is used to find orbits of words that lead to a covering. In particular, a code D found which proves K(13,1) 704, a new record. A direct construction of D given, and its full automorphism group is shown to be the general linear group GL(3,3). It is proved that D is a perfect dominating set (each word not in D is covered by exactly one word in D) and is a counterexample to the recent Uniformity Conjecture of Weichsel.     

Bounds on the Covering Radius of Linear Codes

Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribution of codes to derive new results for linear codes.     

New Results on Codes with Covering Radius 1 and Minimum Distance 2

The minimal cardinality of a q-ary code of length n and covering radius at most R is denoted by K_q(n, R); if we have the additional requirement that the minimum distance be at least d, it is denoted by K_q(n, R, d). Obviously, K_q(n, R, d) K_q(n, R). In this paper, we study instances for which K_q(n,1,2) > K_q(n, 1) and, in particular, determine K₄(4,1,2)=28 > 24=K₄(4,1).Supported in part by the Academy of Finland under grant 100500.     

Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers

The multicovering radii of a code are recentgeneralizations of the covering radius of a code. For positivem, the m-covering radius of C is the leastradius t such that everym-tuple of vectors is contained in at least one ball of radiust centered at some codeword. In this paper upper bounds arefound for the multicovering radii of first order Reed-Muller codes. These bounds generalize the well-known Norse bounds for the classicalcovering radii of first order Reed-Muller codes. They are exactin some cases. These bounds are then used to prove the existence of secure families of keystreams against a general class of cryptanalytic attacks. This solves the open question that gave rise to the study ofmulticovering radii of codes.     

Exact Bounds on the Sizes of Covering Codes

A code c is a covering code of X with radius r if every element of X is within Hamming distance r from at least one codeword from c. The minimum size of such a c is denoted by c _r(X). Answering a question of Hämäläinen et al. [10], we show further connections between Turán theory and constant weight covering codes. Our main tool is the theory of supersaturated hypergraphs. In particular, for n > n ₀(r) we give the exact minimum number of Hamming balls of radius r required to cover a Hamming ball of radius r + 2 in {0, 1}ⁿ. We prove that c _r(B _n(0, r + 2)) = _{1 i r + 1} ( ^{(n + i – 1) / (r + 1) 2}) + n / (r + 1) and that the centers of the covering balls B(x, r) can be obtained by taking all pairs in the parts of an (r + 1)-partition of the n-set and by taking the singletons in one of the parts.     

New Quantum MDS Code from Constacyclic Codes

In recent years, there have been intensive activities in the area of constructing quantum maximum distance separable(MDS for short) codes from constacyclic MDS codes through the Hermitian construction. In this paper, a new class of quantum MDS code is constructed, which extends the result of [Theorems 3.14–3.15, Kai, X., Zhu, S., and Li,P., IEEE Trans. on Inf. Theory, 60(4), 2014, 2080–2086], in the sense that our quantum MDS code has bigger minimum distance.     

Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

A New Table of Binary/Ternary Mixed Covering Codes

A table of upper bounds for K3,2(n1,n2;R), the minimum number of codewords in a covering code with n1 ternary coordinates, n2 binary coordinates, and covering radius R, in the range n = n1 + n2 13, R 3, is presented. Explicit constructions of codes are given to prove the new bounds and verify old bounds. These binary/ternary covering codes can be used as systems for the football pool game. The results include a new binary code with covering radius 1 proving K2(13,1) 736, and the following upper bound for the football pool problem for 9 matches: K3(9,1) 1356.     

Linear Perfect Codes and a Characterization of the Classical Designs

A new definition for the dimension of a combinatorial t-(v,k,) design over a finite field is proposed. The complementary designs of the hyperplanes in a finite projective or affine geometry, and the finite Desarguesian planes in particular, are characterized as the unique (up to isomorphism) designs with the given parameters and minimum dimension. This generalizes a well-known characterization of the binary hyperplane designs in terms of their minimum 2-rank. The proof utilizes the q-ary analogue of the Hamming code, and a group-theoretic characterization of the classical designs.     

Computing Linear Codes and Unitals

The 2-rank of any 2-(28,4,1) design (unital on 28 points) is known to be between 19 and 27. It is shown by the enumeration and analysis of certain binary linear codes that there are no unitals of 2-rank 20, and that there are exactly 4 isomorphism classes of unitals of 2-rank 21. Combined with previous results, this completes the classification of unitals on 28 points of 2-rank less than 22.