On perfect codes and related concepts
From MaRDI portal
Publication:5931253
DOI10.1023/A:1008394205999zbMath0971.94014OpenAlexW1584248758MaRDI QIDQ5931253
Levon H. Khachatrian, Harout Aydinian, Rudolf Ahlswede
Publication date: 2 November 2001
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008394205999
Related Items (37)
On the non-existence of extended 1-perfect codes and MDS codes ⋮ Anticodes in the sum-rank metric ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ Some bounds for the number of blocks. III. ⋮ Constructions of Sidon spaces and cyclic subspace codes ⋮ A new approach towards the Golomb-Welch conjecture ⋮ Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code ⋮ Total perfect codes in Cayley graphs ⋮ A Taxonomy of Perfect Domination ⋮ Perfect 2-coloring of the quartic graphs with order at most 8 ⋮ Linearity and complements in projective space ⋮ On linear diameter perfect Lee codes with distance 6 ⋮ Constructions of large cyclic constant dimension codes via Sidon spaces ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ A family of diameter perfect constant-weight codes from Steiner systems ⋮ Constructions and invariants of optimal codes in the Lee metric ⋮ New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ Galois geometries and coding theory ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ A generalization of Lee codes ⋮ On diameter perfect constant-weight ternary codes ⋮ Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) ⋮ On Rosenbloom and Tsfasman's generalization of the Hamming space ⋮ On the regularity of perfect 2-colorings of the Johnson graph ⋮ On perfect binary codes ⋮ Constructions of cyclic constant dimension codes ⋮ Covering of subspaces by subspaces ⋮ Residual \(q\)-Fano planes and related structures ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Perfect codes in circulant graphs ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Error-correcting codes in attenuated space over finite fields ⋮ Further constructions of cyclic subspace codes ⋮ Fundamentals of coding type problems ⋮ A family of linear codes from constant dimension subspace codes ⋮ Codes and anticodes in the Grassman graph
This page was built for publication: On perfect codes and related concepts
