Results 41 to 50 of about 160 (125)
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes [PDF]
, 2016 The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-46049-9_5[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation.
Fariña, Antonio +9 more
core +1 more source
Canonical trees, compact prefix-free codes, and sums of unit fractions: a probabilistic analysis [PDF]
, 2015 CITATION: Heuberger, C., Krenn, D. & Wagner, S. 2015. Canonical trees, compact prefix-free codes, and sums of unit fractions: a probabilistic analysis. SIAM Journal on Discrete Mathematics, 29(3):1600–1653, doi:10.1137/15M1017107.The original publication
Heuberger, Clemens +2 more
core +1 more source
Lossless quantum prefix compression for communication channels that are always open [PDF]
, 2009 We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum ...
Nagarajan, R., Müller, M., Rogers, C.
core +2 more sources
Complete Variable-Length "Fix-Free" Codes
, 1995 A set of codewords is fix-free if it is both prefix-free and suffix-free: no codeword in the set is a prefix or a suffix of any other. A set of codewords fx 1 ; x 2 ; : : : ; x n g over a t-letter alphabet \Sigma is said to be complete if it satisfies ...
Ronald L. Rivest, David Gillman
core
, 1998 Over the last decade, arithmetic coding has emerged as an important compression tool. It is now the method of choice for adaptive coding on multisymbol alphabets because of its speed, low storage requirements, and effectiveness of compression.
Neal, Radford M. +5 more
core +1 more source
Some basic properties of fix-free codes. [PDF]
, 2000 by Chunxuan Ye.Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.Includes bibliographical references (leaves 74-[78]).Abstracts in English and Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Information Theory --- p.1Chapter 1.2 ...
core
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
, 2002 In this paper we discuss the problem of finding optimal prefix-free codes for unequal letter costs, a variation of the classical Huffman coding problem.
Bradford, Phil +7 more
core +1 more source
Rate of prefix-free codes in LQG control systems
, 2016 In this paper, we consider a discrete time linear quadratic Gaussian (LQG) control problem in which state information of the plant is encoded in a variable-length binary codeword at every time step, and a control input is determined based on the ...
Tobias Oechtering +9 more
core +1 more source
Linear equalizers for quasi-synchronous block spreading CDMA systems [PDF]
, 2009 Recently, a block spreading code division multiple access (BS-CDMA) technique was presented whereby user-specific preceding along with orthogonal spreading codes are used to achieve multi-user interference (MUI) free when all users arrive at the base ...
Mohammud Z. Bocus +5 more
core +1 more source
Topics in Lossless Source and Channel Coding [PDF]
, 2023 This dissertation studies several topics in lossless source and channel coding, including: hexagonal run-length-limited constraints; fix-free codes; characterizations of minimal expected length codes; and the competitive advantage of prefix ...
Congero, Spencer
core