Name
Title | ||
|---|---|---|
Some classes of systematic polynomial codes correcting single- and adjacent transposition errors |
Abstract | ||
|---|---|---|
In this paper, we use 2 check digits to construct systematic polynomial codes over ${{\mathbb{F}}_p}$, where p is an odd prime, that correct all the single- and adjacent transposition errors (which are typographic errors often made by human operators). As a result, we give constructions of several classes of codes with code length $n = \frac{1}{2}\left( {p + 1} \right)$ and $\frac{1}{2}\left( {p - 1} \right)$. In particular, the classes of codes with $n = \frac{1}{2}\left( {p + 1} \right)$ are new to our knowledge; while for the class of codes with $n = \frac{1}{2}\left( {p - 1} \right)$, our construction provides a larger set of code candidates compared with the previous work. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.23919/ISITA.2018.8664376 | 2018 International Symposium on Information Theory and Its Applications (ISITA) |
Keywords | Field | DocType |
Systematics,Error correction codes,Man-machine systems,Decoding,Digital signal processing,Keyboards,Task analysis | Prime (order theory),Discrete mathematics,Polynomial,Computer science,Operator (computer programming),Decoding methods,Check digit | Conference |
ISBN | Citations | PageRank |
978-4-88552-318-2 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanling Chen | 1 | 8 | 5.50 |
| a j han vinck | 2 | 419 | 58.77 |