Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Nonexistence of Perfect Codes in the Johnson Scheme

From MaRDI portal
Publication:4881286
Jump to:navigation, search

DOI10.1137/S0895480194275692zbMath0848.05013MaRDI QIDQ4881286

Tuvi Etzion

Publication date: 30 June 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

Johnson graphJohnson schemenontrivial perfect codes


Mathematics Subject Classification ID

Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Steiner systems in finite geometry (51E10) Combinatorial codes (94B25)


Related Items (6)

Cyclotomic graphs and perfect codes ⋮ Large cycles in generalized Johnson graphs ⋮ On completely regular codes ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Perfect codes in the discrete simplex ⋮ Codes and anticodes in the Grassman graph







This page was built for publication: On the Nonexistence of Perfect Codes in the Johnson Scheme

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4881286&oldid=19253756"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 05:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki