Designing lexicographic codes with a given trellis complexity

DOI10.1109/18.971740zbMATH Open1059.94043OpenAlexW2099945505MaRDI QIDQ4544765FDOQ4544765

Authors: Ari Trachtenberg 

Publication date: 4 August 2002

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

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

Recommendations

• Trellis decoding complexity of linear block codes
• Constructions of generalized concatenated codes and their trellis-based decoding complexity
• scientific article; zbMATH DE number 1284437
• Asymptotically good codes have infinite trellis complexity
• The trellis complexity of convolutional codes

Mathematics Subject Classification ID

Other types of codes (94B60) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (1)

• On the construction of linear \(q\)-ary lexicodes.

This page was built for publication: Designing lexicographic codes with a given trellis complexity

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