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

A lower bound on the greedy weights of product codes

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

DOI10.1023/A:1027382418978zbMath1050.94017OpenAlexW1597386894MaRDI QIDQ1431622

Hans Georg Schaathun

Publication date: 11 June 2004

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1027382418978


zbMATH Keywords

weight hierarchygeneralized Hamming weightsproduct codegreedy weights


Mathematics Subject Classification ID

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


Related Items

The weight hierarchies of \(q\)-ary linear codes of dimension 4 ⋮ Greedy weights for matroids



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