Error states and synchronization recovery for variable length codes

Takishima, Yasuhiro; Wada, Masahiro; Murakami, Hitomi

doi:10.1109/tcomm.1994.577107

Cited by 36 publications

(21 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SER is estimated by means of the Levenshtein distance computed between the initial source sequence and the decoded one. The algorithm computing the Levenshtein distance has been implemented according to [18]. As expected, the bound on the SER is tight at medium to high SNR.…”

Section: Resultsmentioning

confidence: 90%

Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding

Ben-Jamaa

Weidmann

Kieffer

2006

2006 IEEE Workshop on Multimedia Signal Processing

View full text Add to dashboard Cite

Abstract-In joint source-channel (JSC) schemes based on arithmetic coding (AC), additional redundancy may be introduced in order to reduce transmission errors. The purpose of this work is to provide analytical tools to predict and evaluate the effectiveness of that redundancy. Integer binary AC is modeled by a reduced-state automaton in order to obtain a bit-clock trellis of the AC. Considering AC as a trellis code, distance spectra are then derived. In particular, an algorithm to compute the free distance of an arithmetic code is proposed. The obtained code properties allow to compute upper bounds on both bit error and symbol error probabilities and thus provide an objective criterion to analyze the behavior of JSCAC schemes when used on noisy channels.

show abstract

Section: Resultsmentioning

confidence: 90%

Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding

Ben-Jamaa

Weidmann

Kieffer

2006

2006 IEEE Workshop on Multimedia Signal Processing

View full text Add to dashboard Cite

show abstract

“…The formulations in [16,23,24] are in algebraic forms and, as mentioned in [25], a symbolic algebraic software is necessary for computing M EP L, especially when the code size is large. In [26], Takishima et al presented a formula for computing M EP L based on crossover probability, which was further simplified to a new theorem in [24]. We are using the theorem in [27] to calculate the M EP L used in our encryption technique.…”

Section: Bit Flipping System Analysismentioning

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

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

“…Consider a decoder for a complete variable-length prefix code, such as a decoder for a Huffman code [2], e.g., as proposed by Takishima, Wada, and Murakami [3]. Such a decoder may be modelled as a state machine.…”

Section: Introductionmentioning

confidence: 99%

On the maximum Shannon entropy of the full state space of a T-code decoder

Speidel

2008

2008 International Symposium on Information Theory and Its Applications

View full text Add to dashboard Cite

The state space of a decoder for a variable length code is the code's decoding tree. This paper looks at the probabilities with which such a decoder is found in any one particular node of the tree when decoding an infinite random string. The paper then looks at the special case of T-codes, and shows that these probabilities may be derived through a recurrence relation based on the codes' recursive construction scheme. The resulting Shannon entropy of the decoder is shown to be a sum of individual contributions from each construction step. These contributions only depend on the properties of the step itself, but not on the previous construction history.

show abstract

Error states and synchronization recovery for variable length codes

Cited by 36 publications

References 7 publications

Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding

Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding

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

On the maximum Shannon entropy of the full state space of a T-code decoder

Contact Info

Product

Resources

About