On the state complexities of ternary codes

DOI10.1007/3-540-46796-3_43MaRDI QIDQ4502652zbMATH OpenFDO

Authors Sylvia Encheva, Gérard Cohen

Publication date 5 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46796-3_43

zbMATH Keywords

efficient coordinate orderingself-orthogonal codesstate complexitiesternary codestrellis complexity

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• On the state complexity of hyperelliptic codes
• scientific article; zbMATH DE number 1222363
• On a family of Abelian codes and their state complexities
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• On the decoding of some exceptional ternary codes
• A table of state complexity bounds for binary linear codes
• scientific article; zbMATH DE number 3854971
• On the minimum length of ternary linear codes
• Bounds on mixed binary/ternary codes
• On a class of optimal constant weight ternary codes

Cited in

(1)

• On self-dual ternary codes and their coordinate ordering.

This page was built for publication: On the state complexities of ternary codes

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