A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes

DOI10.1016/0304-3975(93)90193-WzbMath0778.68052MaRDI QIDQ1208716

T. Sportelli, Sergio Salemi, Marina Madonia

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

upper bound\(Z\)-deciphering delayalgorithms on \(Z\)-codesdouble \(Z\)- factorization

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Related Items (2)

On coding morphisms for zigzag codes ⋮ A more efficient notion of zigzag stability

Cites Work

• Unnamed Item
• Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)
• Automates et codes zigzag
• On $z$-submonoids and $z$-codes

This page was built for publication: A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes