On the construction of statistically synchronizable codes

Capocelli, Renato M.; Santis, A.A. De; Gargano, Luisa; Vaccaro, Ugo

doi:10.1109/18.119696

Cited by 45 publications

(22 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Contrary to our aim of generating long propagation errors, several works have been proposed to minimize this effect on subsequent codewords. In [13][14][15][16][17][18], solutions have been investigated to overcome such errors by exploiting the correlation among the codewords. A straight forward solution is to drop the corrupted sequence once it is detected and resynchronize from the new synch position within the bit stream.…”

Section: Introductionmentioning

confidence: 99%

“…A straight forward solution is to drop the corrupted sequence once it is detected and resynchronize from the new synch position within the bit stream. The research work involving self-synchronizing codes that quickly help reestablish synchronization and, thus, reduce the run length of error propagation can be found in [13][14][15][16][17][18]. A more complex solution is to approximate the corrupted coefficient value from previous or/and advance values.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps

Almasalha

Hasimoto-Beltrán

Khokhar

2014

Entropy

View full text Add to dashboard Cite

Due to pervasive communication infrastructures, a plethora of enabling technologies is being developed over mobile and wired networks. Among these, video streaming services over IP are the most challenging in terms of quality, real-time requirements and security. In this paper, we propose a novel scheme to efficiently secure variable length coded (VLC) multimedia bit streams, such as H.264. It is based on code word error diffusion and variable size segment shuffling. The codeword diffusion and the shuffling mechanisms are based on random operations from a secure and computationally efficient chaos-based pseudo-random number generator. The proposed scheme is ubiquitous to the end users and can be deployed at any node in the network. It provides different levels of security, with encrypted data volume fluctuating between 5.5-17%. It works on the compressed bit stream without requiring any decoding. It provides excellent encryption speeds on different platforms, including mobile devices. It is 200% faster and 150% more power efficient when compared with AES software-based full encryption schemes. Regarding security, the scheme is robust to well-known attacks in the literature, such as brute force and known/chosen plain text attacks.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps

Almasalha

Hasimoto-Beltrán

Khokhar

2014

Entropy

View full text Add to dashboard Cite

show abstract

“…In [17] the authors have introduced a class of binary prefix codes having the property that each codeword ends in a one. In [18] an application of "1" -ended prefix codes is considered, where it is shown how to construct self-synchronizing codes and how to use them for group testing. A study concerning the bounds on average codeword length for these codes is performed in [19].…”

Section: Introductionmentioning

confidence: 99%

Infinite anti-uniform sources

Tărniceriu¹,

Munteanu²,

Zaharia³

2013

AEU - International Journal of Electronics and Communications

View full text Add to dashboard Cite

Abstract-In this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet. Poisson, negative binomial, geometric and exponential distributions lead to infinite anti -uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as a result of this encoding, we obtain sources with memory. For these sources we attach the graph and derive the transition matrix between states, the state probabilities and the entropy. If c 0 and c 1 denote the costs for storing or transmission of symbols "0" and "1", respectively, we compute the average cost for these AUH codes.

show abstract

“…They also gave an algorithm that determines whether a code has a self-synchronizing string. Capocelli, et al [2] gave an algorithm for constructing prefix codes with self-synchronizing strings such that the average length of the code is close to optimal. They also provided a method for constructing prefix codes with a selfsynchronizing codeword and whose rate redundancy is low.…”

mentioning

confidence: 99%