Bounds for binary codes of length less than 25
From MaRDI portal
Recommendations
- Some Bounds on the Size of Codes
- A new lower bound on the minimal length of a binary linear code
- Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
- Lower bounds for binary covering codes
- On a lower bound on the number of perfect binary codes
- Upper bounds on the cardinality of a binary code with a given minimum distance
- scientific article; zbMATH DE number 774615
- On lower bounds on the spectrum of a binary code
- New bounds for the minimum length of binary linear block codes
- Bounds on the redundancy of binary alphabetical codes
Cited in
(53)- Construction of several classes of maximum codes
- Two new bounds on the size of binary codes with a minimum distance of three
- The sextuply shortened binary Golay code is optimal
- Some lower bounds for constant weight codes
- Note on the size of binary Armstrong codes
- A completion problem for finite affine planes
- Applications of coding theory to the design of somatic cell hybrid panels
- The chromatic number of the square of the 8-cube
- New nonbinary code bounds based on divisibility arguments
- Some recent developments on BIBDs and related designs
- Some results on the existence of binary linear codes (Corresp.)
- Entry-faithful 2-neighbour transitive codes
- A table of upper bounds for binary codes
- Some Bounds on the Size of Codes
- Slight improvements of the Singleton bound
- On the Delsarte inequalities
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- The packing problem for projective geometries over GF(3) with dimension greater than five
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Lower bounds on the minimum average distance of binary codes
- Two new four-error-correcting binary codes
- Packing pairs by quintuples: The case of zero congruence mod 4
- scientific article; zbMATH DE number 3685402 (Why is no real title available?)
- On the maximum number of minimal codewords
- Block size five: quo vadis?
- Upper bounds on the cardinality of a binary code with a given minimum distance
- Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\)
- Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\)
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound
- A tropical approach to secant dimensions
- On the (23,14,5) Wagner code (Corresp.)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Generalized vector space partitions
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- Improved linear programming bound on sizes of doubly constant-weight codes
- Numerical results on the asymptotic rate of binary codes
- On packing designs with block size 5 and index 4
- scientific article; zbMATH DE number 3685396 (Why is no real title available?)
- A new two-error-correcting binary code of length 16
- On optimal binary codes with unbalanced coordinates
- A new upper bound for single error-correcting codes
- A simple proof of the improved Johnson bound for binary codes
- Bounds for Binary Codes With Narrow Distance Distributions
- On the classification of binary completely transitive codes with almost-simple top-group
- On the minimum average distance of binary codes: Linear programming approach
- Sporadic neighbour-transitive codes in Johnson graphs
- On Additive Bases and Harmonious Graphs
- On the average Hamming distance for binary codes
- New bounds for the minimum length of binary linear block codes
- Configuration in binary linear codes
- Copositive matrices, sums of squares and the stability number of a graph
- A new upper bound for binary codes with minimum distance four
This page was built for publication: Bounds for binary codes of length less than 25
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146671)
