Erasure and error correcting ability of Parikh matrices

DOI10.1016/J.IPL.2021.106223OpenAlexW3212929736WikidataQ114167095 ScholiaQ114167095MaRDI QIDQ2059903FDOQ2059903

Authors: Ghajendran Poovanandran, Abdalhadi Abu Zeyneh, Wen Chean Teh, 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

Recommendations

• Parikh matrices and strong \(M\)-equivalence
• Parikh matrices and amiable words
• Criteria for the matrix equivalence of words
• Extending Parikh matrices
• Two-dimensional digitized picture arrays and Parikh matrices

zbMATH Keywords

codeformal languagesefficient correcting algorithmminimal Hamming distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Parikh matrices and amiable words
• A sharpening of the Parikh mapping
• Injectivity of the Parikh matrix mappings revisited
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new study of Parikh matrices restricted to terms
• Some characterizations of Parikh matrix equivalent binary words
• Criteria for the matrix equivalence of words
• Parikh word representability of bipartite permutation graphs
• Some results on Parikh word representable graphs and partitions
• Title not available (Why is that?)
• Subword histories and associated matrices
• Parikh matrices for powers 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
• Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
• \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
• Algebraic properties of Parikh matrices of binary picture arrays
• PARIKH MATRIX MAPPING AND LANGUAGES
• Parikh motivated study on repetitions in words
• Parikh-friendly permutations and uniformly Parikh-friendly words
• Title not available (Why is that?)
• Parikh q-Matrices and q-Ambiguous Words
• Reducing the ambiguity of Parikh matrices

Cited In (2)

• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
• Erasure recovery matrices for encoder protection

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

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