Tunstall adaptive coding and miscoding

Fabris, Francesco; Sgarro, Andrea; Pauletti, R.

doi:10.1109/18.556605

Cited by 15 publications

(16 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The weights of the descendants are the weight of the parent multiplied by the probability of the associated branch. Tunstall's algorithm is exactly isomorphic to Varn's algorithm for exhaustive unequal costs code trees for the uniform source distribution under the mapping rO=tC('), A recent paper by Fabris, Sgarro and Pauletti [235] addresses some characterization results for Tunstall codes, such as the relationship between source probabilities and the resulting minimum and maximum parse string lengths, motivated by applications to adaptive Tunstall parsing.…”

Section: Iii1tunstall Parse Trees and Variantsmentioning

confidence: 99%

Code and parse trees for lossless source encoding

Abrahams

Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)

105

View full text Add to dashboard Cite

Section: Iii1tunstall Parse Trees and Variantsmentioning

confidence: 99%

Code and parse trees for lossless source encoding

Abrahams

Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)

105

View full text Add to dashboard Cite

“…Therefore, the message set can be partitioned into maxEOB subsets where each subset contains all of the messages representing the same amount of EOB symbols (see Table II for the values obtained when coding the test sequence). Recall that the total number of messages is or very close to (3). Therefore all, or nearly all, of the possible codewords are assigned to messages.…”

Section: ) Effect Of Transmission Errorsmentioning

confidence: 99%

“…Tunstall [15] was the first to devise an algorithm to construct optimal FLC codes. Since then, various papers have focused on different aspects of FLC codes: Jelinek [6] analyzed the codec buffer constraints, Ziv [17] and Merhav [9] compared the performance of FLC codes versus VLC codes, Tjalkens [14] and Savari [12] generalized Tunstall's work to sources with memory, Fabris [3] examined the behavior of FLC codes when there is a mismatch between the design source symbol probabilities and the real ones, and Boncelet [2] proposed a low-complexity suboptimal FLC coding algorithm. This paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

Fixed-length entropy coding for robust video compression

Llados-Bernaus

Stevenson

1998

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

Entropy coding is a fundamental stage in all video compression algorithms in terms of compression efficiency and error resilience. Variable-length entropy codes (VLC) are used in current video codecs. Designed to be employed in noiseless applications, these codes are very sensitive to transmission errors. This paper proposes the use of fixed-length entropy codes (FLC) as an alternative to VLC in video compression applications. In noisy transmissions, the FLC-based codec has shown a superior performance compared to VLC-based codecs with synchronization words, while matching its performance in terms of coding efficiency.

show abstract

“…We are interested in studying and . The Kullback-Leibler divergence describes the additional average codelength that different coding schemes incur when designed for the wrong distribution when the correct distribution is [22], [31]- [33]. Given a model distribution for the true user costs, the CKA can use to determine the value of the clipping parameter that minimizes the miscoding penalty.…”

Section: B Sensitivity To Costs From Untrustworthy Usersmentioning

confidence: 99%

Resource-aware conference key establishment for heterogeneous networks

Trappe

Wang

Liu

2005

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-The Diffie-Hellman problem is often the basis for establishing conference keys. In heterogeneous networks, many conferences have participants of varying resources, yet most conference keying schemes do not address this concern and place the same burden upon less powerful clients as more powerful ones. The establishment of conference keys should minimize the burden placed on resource-limited users while ensuring that the entire group can establish the key. In this paper, we present a hierarchical conference keying scheme that forms subgroup keys for successively larger subgroups en route to establishing the group key. A tree, called the conference tree, governs the order in which subgroup keys are formed. Key establishment schemes that consider users with varying costs or budgets are built by appropriately designing the conference tree. We then examine the scenario where users have both varying costs and budget constraints. A greedy algorithm is presented that achieves near-optimal performance, and requires significantly less computational effort than finding the optimal solution. We provide a comparison of the total cost of tree-based conference keying schemes against several existing schemes, and introduce a new performance criterion, the probability of establishing the session key (PESKY), to study the likelihood that a conference key can be established in the presence of budget constraints. Simulations show that the likelihood of forming a group key using a tree-based conference keying scheme is higher than the GDH schemes of Steiner et al.. Finally, we study the effect that greedy users have upon the Huffman-based conference keying scheme, and present a method to mitigate the detrimental effects of the greedy users upon the total cost. Index Terms-Conference key agreement, Diffie-Hellman, Huffman algorithm.

show abstract

Tunstall adaptive coding and miscoding

Cited by 15 publications

References 11 publications

Code and parse trees for lossless source encoding

Code and parse trees for lossless source encoding

Fixed-length entropy coding for robust video compression

Resource-aware conference key establishment for heterogeneous networks

Contact Info

Product

Resources

About