scientific article; zbMATH DE number 1024657

Combinatorial aspects of packing and covering (05B40) 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) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

scientific article; zbMATH DE number 3952657
Covering bounds for codes
On covering problems of codes
scientific article; zbMATH DE number 125908
Switching of covering codes
scientific article; zbMATH DE number 520162
Almost cover-free codes
Classification of binary covering codes
Covering Codes Using Insertions or Deletions
New constructions of covering codes

Cited in

(only showing first 100 items - show all)

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
On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
Upper bounds for binary identifying codes
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
Coverings, centered codes, and combinatorial steganography
The covering radius of Hadamard codes in odd graphs
Covering machines
On lengthening of covering codes
Covering and packing problems in lattices associated with the \(n\)-cube
Ternary covering codes derived from BCH codes
Tiling Hamming space with few spheres
On saturating sets in projective spaces.
Exact bounds on the sizes of covering codes
\(K_{5}(7,3) \leqslant 100\).
New quaternary linear codes with covering radius 2
On saturating sets in small projective geometries
Optimal codes for strong identification
Families of optimal codes for strong identification
Explicit characterization of two classes of regular bent functions
Two infinite classes of rotation symmetric bent functions with simple representation
On regular and new types of codes for location-domination
Dimension 1 sequences are close to randoms
Binary frames with prescribed dot products and frame operator
On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
Saturating sets in projective planes and hypergraph covers
New bounds on the covering radius of the second order Reed-Muller code of length 128
Asymptotically optimal Boolean functions
Lower bound of the covering radius of irreducible Goppa codes
Switching of covering codes
De Bruijn covering codes with arbitrary alphabets
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
The domination complexity and related extremal values of large 3D torus
The existence of perfect codes in a family of generalized Fibonacci cubes
Bounds for optimal coverings
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
Asymmetric binary covering codes.
How long does it take to generate a group?
Generating binary spaces.
An improved upper bound for the football pool problem for nine matches
On coset leader graphs of structured linear codes
On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
On a conjecture regarding identification in Hamming graphs
Multiple coverings of the farthest-off points with small density from projective geometry
On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions)
Hat problem: a new strategy based on quantum stabilizer codes
More permutations and involutions for constructing bent functions
On cutting blocking sets and their codes
Constructing saturating sets in projective spaces using subgeometries
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
On metric regularity of Reed-Muller codes
The multicovering radius problem for some types of discrete structures
On t-revealing codes in binary Hamming spaces
Tolerant location detection in sensor networks
Constructions of r-identifying codes and (r, l)-identifying codes
Covering radius of permutation groups with infinity-norm
Partition-balanced families of codes and asymptotic enumeration in coding theory
Highly nonlinear functions over finite fields
Solving LPN using covering codes
Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions
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
Three-weight codes, triple sum sets, and strongly walk regular graphs
New bounds for linear codes of covering radii 2 and 3
The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
Perfect codes in the discrete simplex
Information retrieval with unambiguous output
On the ensemble of optimal dominating and locating-dominating codes in a graph
Hamming codes for wet paper steganography
Identifying codes and searching with balls in graphs
On identifying codes that are robust against edge changes
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
A construction of small complete caps in projective spaces
On the covering radius of some binary cyclic codes
Binary linear codes from vectorial Boolean functions and their weight distribution
Constant 2-labellings and an application to \((r, a, b)\)-covering codes
Constructing error-correcting binary codes using transitive permutation groups
New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets
Sphere coverings and identifying codes
Literature survey on nonlinear components and chaotic nonlinear components of block ciphers
Invariant sets under linear operator and covering codes over modules
Short coverings in tridimensional spaces arising from sum-free sets
Minimal 1-saturating sets and complete caps in binary projective spaces.
The Rényi-Ulam pathological liar game with a fixed number of lies
Maximal metrically regular sets
Weight distribution moments of random linear/coset codes
Covering the Hamming space with sets translated by linear code vectors
Inverse problems for minimal complements and maximal supplements
On the ensemble of optimal identifying codes in a twin-free graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342497)