Robust universal complete codes for transmission and compression

Fraenkel, Aviezri S.; Klein, Shmuel T.

doi:10.1016/0166-218x(93)00116-h

Cited by 82 publications

(56 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We show in this work that similar properties can be obtained by Fibonacci codes, which have been suggested in the context of compression codes for the unbounded transmission of strings [10] and because of their robustness against errors in data communication applications [11]. They are also studied as a simple alternative to Huffman codes in [12].…”

Section: Introductionmentioning

confidence: 62%

On the Usefulness of Fibonacci Compression Codes

Klein

Ben-Nissan

2009

The Computer Journal

View full text Add to dashboard Cite

Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. This paper shows that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m ≥ 2. Fibonacci codes have been used before, and this paper extends previous work presenting several novel features. In particular, the compression efficiency is analyzed and compared to that of dense codes, and various table-driven decoding routines are suggested.

show abstract

Section: Introductionmentioning

confidence: 62%

On the Usefulness of Fibonacci Compression Codes

Klein

Ben-Nissan

2009

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…In [1] and [5], the authors exploit a Fibonacci coding of the Zeckendorf representation of variablelength binary strings for synchronization and error correction during the transmission of codes. However, to the best of our knowledge, Fibonacci coded binary strings have never been proposed as a foundation for a label storage scheme nor have they been proposed to provide scalabilty to dynamic labeling schemes.…”

Section: Encoding and Decoding The Length Of The Labelmentioning

confidence: 99%

FibLSS: A Scalable Label Storage Scheme for Dynamic XML Updates

O’Connor

Roantree

2013

Advances in Databases and Information Systems

View full text Add to dashboard Cite

Abstract. Dynamic labeling schemes for XML updates have been the focus of significant research activity in recent years. However the label storage schemes underpinning the dynamic labeling schemes have not received as much attention. Label storage schemes specify how labels are physically encoded and stored on disk. The size of the labels and their logical representation directly influence the computational costs of processing the labels and can limit the functionality provided by the dynamic labeling scheme to an XML update service. This has significant practical implications when merging XML repositories such as clinical studies. In this paper, we provide an overview of the existing label storage schemes. We present a novel label storage scheme based on the Fibonacci sequence that can completely avoid relabeling existing nodes under dynamic insertions. Theoretical analysis and experimental results confirm the scalability and performance of the Fibonacci label storage scheme in comparison to existing approaches.

show abstract

“…They lead us to the use of universal codes (UCs) for entropy coding for the applicability regardless of the data distribution. We propose using the Fraenkel and Klein C 1 Fibonacci code [8] (F K 1 ) based on the comparison of well-known UCs in [7]. The recurrence relation F (i) = F (i−1)+F (i−2) with seed values F (0) = 0 and F (1) = 1 defines the sequence F (i) of the famous Fibonacci numbers.…”

Section: B Universal Codes For Entropy Codingmentioning

confidence: 99%

Ultrafast Scalable Embedded DCT Image Coding for Tele-immersive Delay-Sensitive Collaboration

Panggabean¹,

Wielgosz²,

Øverby³

et al. 2013

IJACSA

View full text Add to dashboard Cite

Abstract-A delay-sensitive, real-time, tele-immersive collaboration for the future requires much lower end-to-end delay (EED) for good synchronization than that for existing teleconference systems. Hence, the maximum EED must be guaranteed, and the visual-quality degradation must be graceful. Distributed Multimedia Plays (DMP) architecture addresses the envisioned collaboration and the challenges. We propose a DCT-based, embedded, ultrafast, quality scalable image-compression scheme for the collaboration on the DMP architecture. A parallel FPGA implementation is also designed to show the technical feasibility.

show abstract

Robust universal complete codes for transmission and compression

Cited by 82 publications

References 18 publications

On the Usefulness of Fibonacci Compression Codes

On the Usefulness of Fibonacci Compression Codes

FibLSS: A Scalable Label Storage Scheme for Dynamic XML Updates

Ultrafast Scalable Embedded DCT Image Coding for Tele-immersive Delay-Sensitive Collaboration

Contact Info

Product

Resources

About