Bounds for binary codes of length less than 25
From MaRDI portal
Publication:4146671
DOI10.1109/TIT.1978.1055827zbMath0369.94011WikidataQ56169898 ScholiaQ56169898MaRDI QIDQ4146671
No author found.
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (32)
On Additive Bases and Harmonious Graphs ⋮ Entry-faithful 2-neighbour transitive codes ⋮ Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\) ⋮ Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ Some lower bounds for constant weight codes ⋮ Construction of several classes of maximum codes ⋮ A completion problem for finite affine planes ⋮ Two new bounds on the size of binary codes with a minimum distance of three ⋮ Applications of coding theory to the design of somatic cell hybrid panels ⋮ On the Delsarte inequalities ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ On packing designs with block size 5 and index 4 ⋮ Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound ⋮ The sextuply shortened binary Golay code is optimal ⋮ A tropical approach to secant dimensions ⋮ The chromatic number of the square of the $8$-cube ⋮ Sporadic neighbour-transitive codes in Johnson graphs ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Generalized vector space partitions ⋮ Lower bounds on the minimum average distance of binary codes ⋮ Improved linear programming bound on sizes of doubly constant-weight codes ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ Packing pairs by quintuples: The case of zero congruence mod 4 ⋮ Minimal binary 2-neighbour-transitive codes ⋮ On the average Hamming distance for binary codes ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ The packing problem for projective geometries over GF(3) with dimension greater than five ⋮ A new upper bound for binary codes with minimum distance four ⋮ Two new four-error-correcting binary codes ⋮ Some recent developments on BIBDs and related designs ⋮ Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\)
This page was built for publication: Bounds for binary codes of length less than 25
