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

On nonsystematic perfect binary codes.

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

zbMath1038.94560MaRDI QIDQ1130122

Sergei V. Avgustinovich, Faina I. Solov'eva

Publication date: 19 August 1998

Published in: Problems of Information Transmission (Search for Journal in Brave)



Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)


Related Items

Affine 3-nonsystematic perfect codes of length 15 ⋮ Perfect binary codes of infinite length with complete system of triples ⋮ Mollard code as a robust nonlinear code ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ On perfect binary codes ⋮ Embedding in a perfect code ⋮ Systematic and nonsystematic perfect codes of infinite length over finite fields ⋮ Full rank perfect codes and \(\alpha \)-kernels ⋮ Affine 3-nonsystematic codes ⋮ On enumeration of the perfect binary codes of length 15



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