Binary arithmetic coding with key-based interval splitting

Binary arithmetic coding involves recursive partitioning the range [0,1) in accordance with the relative probabilities of occurrence of the two input symbols. We describe a modification of this approach in which the overall length within the range [0,1) allocated to each symbol is preserved, but the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE signal processing letters Ročník 13; číslo 2; s. 69 - 72
Hlavní autoři: Jiangtao Wen, Hyungjin Kim, Villasenor, J.D.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.02.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Arithmetic
Arithmetic codes
Arithmetic coding
Compressing
Cryptography
Data compression
Decoders
Decoding
Encoders
Encoding
Intervals
Probability distribution
Recursive
Splitting
Standards development
Symbols
Transform coding
ISSN:1070-9908, 1558-2361
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Binary arithmetic coding involves recursive partitioning the range [0,1) in accordance with the relative probabilities of occurrence of the two input symbols. We describe a modification of this approach in which the overall length within the range [0,1) allocated to each symbol is preserved, but the traditional assumption that a single contiguous interval is used for each symbol is removed. A key known to both the encoder and decoder is used to describe where the intervals are "split" prior to encoding each new symbol. The repeated splitting has the effect of both scrambling the intervals and altering their lengths, thereby allowing both encryption and compression to be obtained simultaneously.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2005.861589