Polypodic codes

DOI10.1051/ITA:2002002MaRDI QIDQ4800263zbMATH OpenOpenAlexFDO

Authors Symeon Bozapalidis, Olympia Louscou-Bozapalidou

Publication date 2 April 2003

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

Full work available at URL http://www.numdam.org/item?id=ITA_2002__36_1_5_0, https://eudml.org/doc/92691

zbMATH Keywords

code decomposition

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Grammatical codes of trees
• scientific article; zbMATH DE number 475410
• scientific article; zbMATH DE number 3985118
• Properties of grammatical codes of trees
• Codes, orderings, and partial words

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 475410 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• scientific article; zbMATH DE number 1543313 (Why is no real title available?)
• Bottom-up and top-down tree transformations— a comparison
• Superassociative systems and logical functors

Cited in

(3)

• scientific article; zbMATH DE number 1543313 (Why is no real title available?)
• Polyadic Codes Revisited
• scientific article; zbMATH DE number 1972783 (Why is no real title available?)

This page was built for publication: Polypodic codes

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