Perfect binary codes: constructions, properties, and enumeration
From MaRDI portal
Publication:4838630
DOI10.1109/18.335887zbMath0824.94029OpenAlexW2166966427MaRDI QIDQ4838630
Publication date: 15 November 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.335887
upper boundweight distributionnonlinear perfect binary codesfull-rankintersection of two perfect codes
Related Items (34)
Minimum supports of eigenfunctions of graphs: a survey ⋮ On the binary codes with parameters of doubly-shortened 1-perfect codes ⋮ Kernels of nonlinear Hamming codes ⋮ On the number of \(q\)-ary quasi-perfect codes with covering radius 2 ⋮ On non-full-rank perfect codes over finite fields ⋮ Projective tilings and full-rank perfect codes ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ On full-rank perfect codes over finite fields ⋮ On the embedding of constant-weight codes into perfect codes ⋮ Binary extended perfect codes of length 16 and rank 14 ⋮ Optimal functions with spectral constraints in hypercubes ⋮ Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes ⋮ Local duality theorem for \(q\)-ary 1-perfect codes ⋮ A note on the symmetry group of full rank perfect binary codes ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph ⋮ Switching codes and designs ⋮ Linear maps of perfect codes and irregular \(C\)-partitions ⋮ Construction of two- or three-weight binary linear codes from Vasil'ev codes ⋮ On the subset sum problem for finite fields ⋮ On perfect binary codes ⋮ Embedding in a perfect code ⋮ STS-graphs of perfect codes mod kernel ⋮ Local spectra of perfect binary codes ⋮ On the size of the symmetry group of a perfect code ⋮ A family of group divisible designs with arbitrary block sizes ⋮ Binary Hamming codes and Boolean designs ⋮ Generalized MacWilliams identities and their applications to perfect binary codes ⋮ On intersections of Reed-Muller like codes ⋮ A new class of security oriented error correcting robust codes ⋮ Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. ⋮ Perfect codes in the discrete simplex ⋮ Bounds on the rank and kernel of perfect codes ⋮ Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph ⋮ On enumeration of the perfect binary codes of length 15
This page was built for publication: Perfect binary codes: constructions, properties, and enumeration
