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

Bounds on the minimum distance of the duals of BCH codes

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

DOI10.1109/18.508853zbMath0866.94021OpenAlexW2158924721MaRDI QIDQ4885730

Daniel Augot, Françoise Levy-dit-Vehel

Publication date: 25 September 1996

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

Full work available at URL: https://doi.org/10.1109/18.508853


zbMATH Keywords

dualsBCH codesWeil boundHartmann-Tzeng boundrank-bound algorithm


Mathematics Subject Classification ID

Cyclic codes (94B15)


Related Items (3)

Codes with girth 8 Tanner graph representation ⋮ ON TWO PROBLEMS OF ASYMMETRIC QUANTUM CODES ⋮ On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i  + 1, 2 j  + 1}




This page was built for publication: Bounds on the minimum distance of the duals of BCH codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4885730&oldid=19263742"
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 06:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki