Erasure and error correcting ability of Parikh matrices

DOI10.1016/j.ipl.2021.106223OpenAlexW3212929736WikidataQ114167095 ScholiaQ114167095MaRDI QIDQ2059903

Abdalhadi Abu Zeyneh, Wen Chean Teh, Ghajendran Poovanandran, Adrian Atanasiu

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106223

zbMATH Keywords

codeformal languagesefficient correcting algorithmminimal Hamming distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Subword histories and associated matrices
• Criteria for the matrix equivalence of words
• Elementary matrix equivalence and core transformation graphs for Parikh matrices
• On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
• Parikh word representability of bipartite permutation graphs
• \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
• Algebraic properties of Parikh matrices of binary picture arrays
• Parikh matrices for powers of words
• Some results on Parikh word representable graphs and partitions
• Parikh matrices and amiable words
• PARIKH MATRIX MAPPING AND LANGUAGES
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• Parikh Motivated Study on Repetitions in Words
• Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
• Parikh q-Matrices and q-Ambiguous Words
• A New Study of Parikh Matrices Restricted to Terms
• Reducing the ambiguity of Parikh matrices

This page was built for publication: Erasure and error correcting ability of Parikh matrices