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

Minimum block length of a linear q-ary code with specified dimension and code distance

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

zbMath0568.94024MaRDI QIDQ1061095

Stefan Dodunekov

Publication date: 1984

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


zbMATH Keywords

minimum-length codesrefinements of the Griesmer bound


Mathematics Subject Classification ID

Linear codes (general theory) (94B05)


Related Items (7)

The nonexistence of ternary \([105,6,68\) and \([230,6,152]\) codes] ⋮ Some optimal codes from algebraic geometry and their covering radii ⋮ Optimal ternary linear codes ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ Divisibility of codes meeting the Griesmer bound ⋮ New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4) ⋮ Classification of Griesmer codes and dual transform







This page was built for publication: Minimum block length of a linear q-ary code with specified dimension and code distance

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