Randomized generation of error control codes with automata and transducers
DOI10.1051/ITA/2018015zbMATH Open1423.68260OpenAlexW2911506693WikidataQ128475055 ScholiaQ128475055MaRDI QIDQ5223614FDOQ5223614
Authors: 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
Recommendations
randomized algorithmmaximal codeserror-control codessynchronization errorsoutput polynomial-time algorithmcombinatorial channels
Formal languages and automata (68Q45) Randomized algorithms (68W20) Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the enumeration of minimal dominating sets and related notions
- Probability and Computing
- Optimal binary linear codes of length \(\leq 30\)
- Title not available (Why is that?)
- On generating all maximal independent sets
- Combinatorial problems motivated by comma‐free codes
- Formal descriptions of code properties: decidability, complexity, implementation
- Title not available (Why is that?)
- Maximal error-detecting capabilities of formal languages
- Insertion/Deletion Detecting Codes and the Boundary Problem
- A note on double insertion/deletion correcting codes
- Implementation of code properties via transducers
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Randomized generation of error control codes with automata and transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223614)