Residue Number Systems provide a means to construct non-binary, multiple error correcting, arithmetic codes. Alower bound to redundancy allowing t-error correction in these codes is reported. It is shown that this bound is reached by two classes of codes, whose properties are discussed in detail. In both cases, error correction is performed by finding appropriate solutions to a key congruence, identical for both classes. Two different decoding algorithms and examples are reported.
Arithmetic codes in residue number systems
1977
Abstract
Residue Number Systems provide a means to construct non-binary, multiple error correcting, arithmetic codes. Alower bound to redundancy allowing t-error correction in these codes is reported. It is shown that this bound is reached by two classes of codes, whose properties are discussed in detail. In both cases, error correction is performed by finding appropriate solutions to a key congruence, identical for both classes. Two different decoding algorithms and examples are reported.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_422326-doc_150138.pdf
accesso aperto
Descrizione: Arithmetic codes in residue number systems
Dimensione
1.8 MB
Formato
Adobe PDF
|
1.8 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
