Any lifting of a trace coding is a word coding

DOI10.1006/INCO.1996.0088zbMATH Open0872.68145OpenAlexW2140836724MaRDI QIDQ675053FDOQ675053

Authors: Véronique Bruyère, Clelia De Felice 

Publication date: 29 April 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0088

Recommendations

• On codings of traces
• Lifted codes and their weight enumerators
• On a class of traceability codes
• A note on an upper bound of traceability codes
• On Lifting Perfect Codes
• Coding and strong coding in trace monoids
• A Note About the Traceability Properties of Linear Codes
• Lifting the Fundamental Cone and Enumerating the Pseudocodewords of a Parity-Check Code
• scientific article; zbMATH DE number 125910
• scientific article; zbMATH DE number 1756015

zbMATH Keywords

trace coding

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (1)

• Undecidability of the trace coding problem and some decidable cases

This page was built for publication: Any lifting of a trace coding is a word coding

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