Relativized codes

DOI10.1016/j.tcs.2011.12.024zbMath1263.94018DBLPjournals/tcs/DaleyJKM12OpenAlexW2912588130WikidataQ62046595 ScholiaQ62046595MaRDI QIDQ418759

Lila Kari, Kalpana Mahalingam, Helmut Jürgensen, Mark Daley

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.024

zbMATH Keywords

decodingfactorizationprefix codesolid codeconcatenationbifix codeDNA encodingoverlap-free coderestricted message spacesuffix code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (1)

Automata for solid codes

Cites Work

• On the defect theorem and simplifiability
• Deciding the immutability of regular codes and languages under finite transduction
• Relations on free monoids, their independent sets, and codes¹
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relativized codes