Randomized generation of error control codes with automata and transducers

DOI10.1051/ita/2018015zbMath1423.68260OpenAlexW2911506693WikidataQ128475055 ScholiaQ128475055MaRDI QIDQ5223614

Stavros Konstantinidis, Nelma Moreira, Rogério Reis

Publication date: 18 July 2019

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

Full work available at URL: https://doi.org/10.1051/ita/2018015

zbMATH Keywords

randomized algorithmmaximal codeserror-control codessynchronization errorsoutput polynomial-time algorithmcombinatorial channels

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Randomized algorithms (68W20) Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Approximate NFA universality and related problems motivated by information theory ⋮ Approximate NFA universality motivated by information theory

Uses Software

• FAdo
• GUItar
• Python
• PyPy

Cites Work

• On generating all maximal independent sets
• Optimal binary linear codes of length \(\leq 30\)
• Implementation of Code Properties via Transducers
• FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION
• A note on double insertion/deletion correcting codes
• Combinatorial problems motivated by comma‐free codes
• On the Enumeration of Minimal Dominating Sets and Related Notions
• Insertion/Deletion Detecting Codes and the Boundary Problem
• Probability and Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randomized generation of error control codes with automata and transducers