Perfect Single Error-Correcting Codes in the Johnson Scheme

From MaRDI portal

Revision as of 01:12, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3548130

Jump to:navigation, search

DOI10.1109/TIT.2006.881744zbMath1323.94170arXivmath/0508575OpenAlexW3100362115MaRDI QIDQ3548130

Daniel M. Gordon

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (8)

Perfect codes in Doob graphs ⋮ Minimum supports of eigenfunctions of Johnson graphs ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ On completely regular codes ⋮ Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) ⋮ On the regularity of perfect 2-colorings of the Johnson graph ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Perfect codes in the discrete simplex

This page was built for publication: Perfect Single Error-Correcting Codes in the Johnson Scheme

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3548130&oldid=16932582"