Binary codes with a minimum distance of four (Corresp.)
From MaRDI portal
Publication:3919599
DOI10.1109/TIT.1980.1056269zbMath0466.94020MaRDI QIDQ3919599
No author found.
Publication date: 1980
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (14)
Two-level screening designs derived from binary nonlinear codes ⋮ What are all the best sphere packings in low dimensions? ⋮ A new sphere packing in 20 dimensions ⋮ Two new bounds on the size of binary codes with a minimum distance of three ⋮ On the structure of optimal error-correcting codes ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ From sphere packing to Fourier interpolation ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ Rigidity of spherical codes ⋮ The clique distribution in powers of hypercubes ⋮ The chromatic number of the square of the $8$-cube ⋮ The extended 1-perfect trades in small hypercubes ⋮ A new upper bound for binary codes with minimum distance four ⋮ Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
This page was built for publication: Binary codes with a minimum distance of four (Corresp.)
