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)

Bounds on Distance Distributions in Codes of Given Size ⋮ On identifying codes that are robust against edge changes ⋮ Approximating Boolean Functions with Depth-2 Circuits ⋮ Maximal metrically regular sets ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ Weight distribution moments of random linear/coset codes ⋮ New lower bounds for multiple coverings ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ The maximum degree \& diameter-bounded subgraph and its applications ⋮ On the covering radii of a class of binary primitive cyclic codes ⋮ A construction of small complete caps in projective spaces ⋮ On the covering radius of some binary cyclic codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inverse problems for minimal complements and maximal supplements ⋮ Binary linear codes from vectorial Boolean functions and their weight distribution ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ The (non-)existence of perfect codes in Lucas cubes ⋮ Constant 2-labellings and an application to $(r, a, b)$-covering codes ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ Covering Radius of Matrix Codes Endowed with the Rank Metric ⋮ Dimension of Marginals of Kronecker Product Models ⋮ An enumeration of 1-perfect ternary codes ⋮ Coupled-Cluster theory revisited ⋮ Several classes of new weakly regular bent functions outside $\mathcal{RF}$, their duals and some related (minimal) codes with few weights ⋮ New short coverings of $\mathbb{F}_q^3$ from pairwise weakly linearly independent sets ⋮ On some punctured codes of ℤq-Simplex codes ⋮ Some results about a conjecture on identifying codes in complete suns ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ The Football Pool Polytope ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ On higher order nonlinearities of Boolean functions ⋮ Upper bounds on the length function for covering codes with covering radius $R$ and codimension $tR+1$ ⋮ The lower bounds on the second-order nonlinearity of three classes of Boolean functions ⋮ Spanning Trees and Domination in Hypercubes ⋮ A lower bound on the third-order nonlinearity of the simplest $\mathcal{PS}_{a p}$ bent functions ⋮ Covering codes for the fixed length Levenshtein metric ⋮ On the weight distribution of the cosets of MDS codes ⋮ New classes of bent functions via the switching method ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ On forced periodicity of perfect colorings ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ Saturating systems and the rank-metric covering radius ⋮ Sets arising as minimal additive complements in the integers ⋮ The second-order football-pool problem and the optimal rate of generalized-covering codes ⋮ Sphere coverings and identifying codes ⋮ Several classes of bent functions over finite fields ⋮ Literature survey on nonlinear components and chaotic nonlinear components of block ciphers ⋮ Invariant sets under linear operator and covering codes over modules ⋮ On the general excess bound for binary codes with covering radius one ⋮ On the Kronecker Product Construction of Completely Transitive q-Ary Codes ⋮ On the general excess bound for binary codes with covering radius one ⋮ Short coverings in tridimensional spaces arising from sum-free sets ⋮ One-Sided Error Communication Complexity of Gap Hamming Distance. ⋮ On the Link of Some Semi-bent Functions with Kloosterman Sums ⋮ ON METRIC COMPLEMENTS AND METRIC REGULARITY IN FINITE METRIC SPACES ⋮ Short covering codes arising from matchings in weighted graphs ⋮ On mixed codes with covering radius 1 and minimum distance 2 ⋮ Unnamed Item ⋮ Minimal 1-saturating sets and complete caps in binary projective spaces. ⋮ Toroidal boards and code covering ⋮ On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations ⋮ Descriptional Complexity of Error Detection ⋮ Integer zeros of $q$-Krawtchouk polynomials in classical combinatorics ⋮ Covering radius of permutation groups with infinity-norm ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Optimal Covering Codes for Finding Near-Collisions ⋮ Highly nonlinear functions over finite fields ⋮ Locating-Domination and Identification ⋮ Solving LPN using covering codes ⋮ Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions ⋮ Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture ⋮ A lower bound on the size of the largest metrically regular subset of the Boolean cube ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space ⋮ On transitive uniform partitions of $F^n$ into binary Hamming codes ⋮ Invariant sets under permutation, extremal graphs, and covering codes ⋮ Short coverings and matching in weighted graphs ⋮ Three-weight codes, triple sum sets, and strongly walk regular graphs ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ An updated table of binary/ternary mixed covering codes ⋮ The covering radius of the Reed-Muller code $\text{RM}(2, 7)$ is $40$ ⋮ Towards using the history in online computation with advice ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mixture decompositions of exponential families using a decomposition of their sample spaces ⋮ Weighted perfect codes in Lee metric ⋮ New covering codes of radius $R$, codimension $tr$ and $tr+\frac{R}{2}$, and saturating sets in projective spaces ⋮ New Constructions and Bounds for Winkler's Hat Game ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ Perfect codes in the discrete simplex ⋮ Rainbow perfect domination in lattice graphs ⋮ Rank-Metric Codes and Their Applications ⋮ Information retrieval with unambiguous output ⋮ On the ensemble of optimal dominating and locating-dominating codes in a graph ⋮ Codes Identifying Vertices in Graphs ⋮ Perfect codes in Cartesian products of hypercube and multidimensional grid ⋮ Hamming codes for wet paper steganography ⋮ Identifying codes and searching with balls in graphs ⋮ Saturating linear sets of minimal rank

This page was built for publication: