This paper gives some theory and efficient design of binary block codes capable of controlling the deletions of the symbol "0" (referred to as 0-deletions) and/or the insertions of the symbol "0" (referred to as 0-insertions). This problem of controlling 0-deletions and/or 0-insertions (referred to as 0-errors) is shown to be equivalent to the efficient design of L-1 metric asymmetric error control codes over the natural alphabet, IN. Optimal systematic code designs are given. In particular, for all t, k is an element of IN, a recursive method is presented to encode k information bits into efficient systematic t Symmetric 0-Error Correcting, (t + 1) Symmetric 0-Error Detecting and All Unidirectional 0-Error Detecting (t-Sy0EC/(t + 1)-Sy0ED/AU0ED) codes of length n <= k + t log(2) k + o(t log n) as n is an element of IN increases. Decoding can be efficiently performed by algebraic means using the Extended Euclidean Algorithm (EEA).

Efficient Systematic Deletions/Insertions of 0’s Error Control Codes

Tallini, Luca G.
;
2022-01-01

Abstract

This paper gives some theory and efficient design of binary block codes capable of controlling the deletions of the symbol "0" (referred to as 0-deletions) and/or the insertions of the symbol "0" (referred to as 0-insertions). This problem of controlling 0-deletions and/or 0-insertions (referred to as 0-errors) is shown to be equivalent to the efficient design of L-1 metric asymmetric error control codes over the natural alphabet, IN. Optimal systematic code designs are given. In particular, for all t, k is an element of IN, a recursive method is presented to encode k information bits into efficient systematic t Symmetric 0-Error Correcting, (t + 1) Symmetric 0-Error Detecting and All Unidirectional 0-Error Detecting (t-Sy0EC/(t + 1)-Sy0ED/AU0ED) codes of length n <= k + t log(2) k + o(t log n) as n is an element of IN increases. Decoding can be efficiently performed by algebraic means using the Extended Euclidean Algorithm (EEA).
2022
978-1-6654-8342-1
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11575/145320
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 0
social impact