Forward error correcting codes by means of the two-base (2,3)-numeration system

Anisimov, A. V.; Zavadskyi, Igor O.

doi:10.1109/blackseacom.2014.6849015

Cited by 2 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then the bits of these triads that contain errors are determined with the help of an exhaustive algorithm. A similar approach is described in [3]. Its main drawback is the constraint connected with the presence of no more than one error in each triad.…”

Section: External Codingmentioning

confidence: 91%

See 1 more Smart Citation

Variable-Length Error-Correcting Codes Based on Finite Automata

Zavadskyi

2015

Cybern Syst Anal

View full text Add to dashboard Cite

A new method for error-correcting coding is proposed. It is based on processing information messages by finite automata and using a two-base numeral system. The two-level structure of an encoder provides powerful error-correcting capabilities. On the first (internal) level, an input message is considered as a binary number represented as a lower (2,3) code that has some redundancy and error-correcting properties. The noise-resistant properties are strengthened on the external level where the code is processed by a special finite automaton. It is a variable-length code, i.e., the codeword length depends not only on the length of an input message but also on the message content. However, the average code rate equals 1/2.

show abstract

Section: External Codingmentioning

confidence: 91%

“…(2,3) coding was first described in [1], and lower (2,3) coding, methods of its construction, and its noise-immune properties were investigated in [2]. We now give basic definitions.…”

Section: Internal Codingmentioning

confidence: 99%

Variable-Length Error-Correcting Codes Based on Finite Automata

Zavadskyi

2015

Cybern Syst Anal

View full text Add to dashboard Cite

show abstract

New concept of universal coding using one step reversible low contrast mapping (1RLCM)

Mesra

Tjandrasa

Fatichah

2019

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Universal coding was developed for compressing data that the probability distribution of a symbol is unknown. Universal coding methods encode a symbol using some bits as code based on the coding algorithm. This research introduces a new concept of universal coding by encoding two symbols using Reversible Low Contrast Mapping (RLCM) transform. The proposed method transforms a pair non negative integer to a non-negative integer and a binary number. This research also introduces a compression scheme namely Average Encoding (AE) to compress a sequence of data using the proposed coding method. This method generally yields a higher compression ratio than the Elias Delta, Elias Gamma, and Fibonacci coding when it is tested using the results of differential encoding of some testing images.

show abstract

Forward error correcting codes by means of the two-base (2,3)-numeration system

Cited by 2 publications

References 2 publications

Variable-Length Error-Correcting Codes Based on Finite Automata

Variable-Length Error-Correcting Codes Based on Finite Automata

New concept of universal coding using one step reversible low contrast mapping (1RLCM)

Contact Info

Product

Resources

About