Perfect codes in Doob graphs

DOI10.1007/S10623-015-0066-6zbMath1348.94082arXiv1407.6329OpenAlexW3102043406MaRDI QIDQ300388

Denis S. Krotov

Publication date: 27 June 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6329

zbMATH Keywords

perfect codesdistance regular graphsDoob graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

On the minimum supports of some eigenfunctions in the Doob graphs ⋮ Neighbour-transitive codes in Kneser graphs ⋮ Additive perfect codes in Doob graphs ⋮ MDS codes in Doob graphs ⋮ A new distance-regular graph of diameter 3 on 1024 vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight 2-designs and perfect 1-codes in Doob graphs
• Anticodes for the Grassmann and bilinear forms graphs
• A product construction for perfect codes over arbitrary alphabets (Corresp.)
• Configuration distribution and designs of codes in the Johnson scheme
• Perfect Single Error-Correcting Codes in the Johnson Scheme
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
• Error Detecting and Error Correcting Codes
• A characterization of 1-perfect additive codes
• On the Nonexistence of Perfect Codes over Finite Fields

This page was built for publication: Perfect codes in Doob graphs