On coding morphisms for zigzag codes

DOI10.1051/ITA/1992260605651zbMATH Open0766.68074OpenAlexW105663962MaRDI QIDQ4032306FDOQ4032306

Authors: Do Long Van, Bertrand Le Saëc, Igor Litovsky 

Publication date: 1 April 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92434

Recommendations

• Stability for the zigzag submonoids
• Automates et codes zigzag
• On $z$-submonoids and $z$-codes
• Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)
• Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)

zbMATH Keywords

monoid morphismszigzag codesfree group morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Two-way automaton computations
• Automates et codes zigzag
• Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)
• Title not available (Why is that?)
• Stability for the zigzag submonoids
• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• On $z$-submonoids and $z$-codes

Cited In (5)

• Zigzag codes and \(z\)-free hulls
• A more efficient notion of zigzag stability
• Zigzag Codes: MDS Array Codes With Optimal Rebuilding
• Stability for the zigzag submonoids
• Zigzag codes and concatenated zigzag codes

This page was built for publication: On coding morphisms for zigzag codes

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