scientific article; zbMATH DE number 1024657

Antoine C. Lobstein, Gérard D. Cohen, Simon N. Litsyn, Iiro S. Honkala

Publication date: 22 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

covering radius perfect codes multiple coverings covering code weighted coverings asymptotical covering radius problems sphere-covering bound

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40) Theory of error-correcting codes and error-detecting codes (94Bxx)

Related Items (only showing first 100 items - show all)

Optimal codes for strong identification ⋮ More permutations and involutions for constructing bent functions ⋮ Families of optimal codes for strong identification ⋮ On the ensemble of optimal identifying codes in a twin-free graph ⋮ Generating binary spaces. ⋮ An improved upper bound for the football pool problem for nine matches ⋮ On cutting blocking sets and their codes ⋮ Quasi-perfect linear codes from planar and APN functions ⋮ On the resilience of Even-Mansour to invariant permutations ⋮ Explicit characterization of two classes of regular bent functions ⋮ On the lower bounds of the second order nonlinearities of some Boolean functions ⋮ Covering and packing problems in lattices associated with the \(n\)-cube ⋮ On a new class of identifying codes in graphs ⋮ On the second-order nonlinearity of the hidden weighted bit function ⋮ On the number of solutions of certain diagonal equations over finite fields ⋮ Further results on multiple coverings of the farthest-off points ⋮ Two infinite classes of rotation symmetric bent functions with simple representation ⋮ Variation on correlation immune Boolean and vectorial functions ⋮ Further results on the covering radius of small codes ⋮ Constructing saturating sets in projective spaces using subgeometries ⋮ Ternary covering codes derived from BCH codes ⋮ Tiling Hamming space with few spheres ⋮ Small complete caps in Galois affine spaces ⋮ Saturating Sperner families ⋮ On optimal binary codes with unbalanced coordinates ⋮ On regular and new types of codes for location-domination ⋮ Several new classes of self-dual bent functions derived from involutions ⋮ A new lower bound on the second-order nonlinearity of a class of monomial bent functions ⋮ Improved algorithms for quantum identification of Boolean oracles ⋮ Dimension 1 sequences are close to randoms ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ Binary frames with prescribed dot products and frame operator ⋮ On saturating sets in projective spaces. ⋮ On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) ⋮ On perfect codes in Cartesian products of graphs ⋮ Saturating sets in projective planes and hypergraph covers ⋮ Remoteness of permutation codes ⋮ The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity ⋮ Random low-degree polynomials are hard to approximate ⋮ Galois geometries and coding theory ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ On metric regularity of Reed-Muller codes ⋮ Switching codes and designs ⋮ On the covering radius of some modular codes ⋮ Memoryless near-collisions via coding theory ⋮ New bounds on the covering radius of the second order Reed-Muller code of length 128 ⋮ Asymptotically optimal Boolean functions ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ Density of constant radius normal binary covering codes ⋮ A new binary code of length 16 and minimum distance 3 ⋮ Bent vectorial functions and linear codes from o-polynomials ⋮ Lower bound of the covering radius of irreducible Goppa codes ⋮ New bounds on binary identifying codes ⋮ On coset leader graphs of structured linear codes ⋮ Switching of covering codes ⋮ On the nonlinearity of S-boxes and linear codes ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ A survey and classification of Sierpiński-type graphs ⋮ The multicovering radius problem for some types of discrete structures ⋮ On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes ⋮ Adaptive identification in graphs ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ On a conjecture regarding identification in Hamming graphs ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ On identifying codes in binary Hamming spaces ⋮ Bounds for short covering codes and reactive tabu search ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ De Bruijn covering codes with arbitrary alphabets ⋮ On \(t\)-revealing codes in binary Hamming spaces ⋮ Covering radius for sets of permutations ⋮ Several infinite families of \(p\)-ary weakly regular bent functions ⋮ A connection between sumsets and covering codes of a module ⋮ Tolerant location detection in sensor networks ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes ⋮ The domination complexity and related extremal values of large 3D torus ⋮ Weighted codes in Lee metrics ⋮ Lower bounds on covering codes via partition matrices ⋮ On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes] ⋮ The existence of perfect codes in a family of generalized Fibonacci cubes ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ Covering radius of permutation groups with infinity-norm ⋮ The string guessing problem as a method to prove lower bounds on the advice complexity ⋮ Upper bounds for binary identifying codes ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Linear programming bounds for codes via a covering argument ⋮ On the size of identifying codes in binary hypercubes ⋮ A remark on Haas' method ⋮ Linear codes for high payload steganography ⋮ New quaternary linear codes with covering radius 2 ⋮ Bounds for optimal coverings ⋮ On saturating sets in small projective geometries ⋮ Coverings, centered codes, and combinatorial steganography ⋮ On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions) ⋮ A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. ⋮ Hat problem: a new strategy based on quantum stabilizer codes ⋮ Asymmetric binary covering codes. ⋮ How long does it take to generate a group?

This page was built for publication: