Name
Abstract | ||
|---|---|---|
We introduce the concept of an f-maximal error-detecting block code, for some parameter f in (0,1), in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our motivation for this is that it is computationally hard to decide whether an error-detecting block code is maximal. We present an output-polynomial time randomized algorithm that takes as input two positive integers N, l and a specification of the errors permitted in some application, and generates an error-detecting, or error-correcting, block code of length l that is 99%-maximal, or contains N words with a high likelihood. We model error specifications as (nondeterministic) transducers, which allow one to represent any rational combination of substitution and synchronization errors. We also present some elements of our implementation of various error-detecting properties and their associated methods. Then, we show several tests of the implemented randomized algorithm on various error specifications. A methodological contribution is the presentation of how various desirable error combinations can be expressed formally and processed algorithmically. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1051/ita/2018015 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
Randomized algorithm,output polynomial time algorithm,error control codes,maximal codes,synchronization errors,combinatorial channels | Integer,Errors-in-variables models,Randomized algorithm,Combinatorics,Synchronization,Nondeterministic algorithm,Automaton,Block code,Arithmetic,Error detection and correction,Mathematics | Journal |
Volume | Issue | ISSN |
52 | SP2-4 | 0988-3754 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stavros Konstantinidis | 1 | 283 | 31.10 |
| Nelma Moreira | 2 | 180 | 33.98 |
| Rogério Reis | 3 | 140 | 25.74 |