Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis

DOI10.1109/18.556699zbMATH Open0865.94028DBLPjournals/tit/VardyK96OpenAlexW2134656914WikidataQ59768147 ScholiaQ59768147MaRDI QIDQ3129485FDOQ3129485

Authors Alexander Vardy, Frank R. Kschischang 

Publication date 15 July 1997

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

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

zbMATH Keywords

trellis complexityViterbi decodingminimal trellisrectangular codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• A proof of a conjecture on the Estrada index
• Proof of a S.Mac Lane conjecture (extended abstract)
• Proving a conjecture of Gutman concerning trees with minimal ABC index
• Matrix theory for minimal trellises
• On a theorem of M. Marcus and H. Mine and a little known expansion formula for permanents^*
• Proof of W. M. Schmidt's conjecture concerning successive minima of a lattice
• Proving a conjecture concerning trees with maximal reduced reciprocal Randić index
• The proof of a conjecture on the reduced Sombor index
• Proof of Moll's minimum conjecture
• Trellis complexity and minimal trellis diagrams of lattices

This page was built for publication: Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129485)