Results 61 to 70 of about 160 (125)
, 1997 The classic Hufman Coding Problem of finding a minimum cost prefix-free code is almost completely understood. There still exist many variants of this problem which are not as well understood. In this thesis we consider four variants.
Chan, Sze-Lok
core
Parallel Construction of the Minimum Redundancy Length-Limited Codes
, 2002 This paper presents new results on the construction of the length-limited prefix-free codes with the minimum redundancy. We describe an algorithm for the construction of length-limited codes that works in O(L) time with n processors, where L is the ...
Marek Karpinski, Yakov Nekrich
core
, 2018 In order to guarantee the synchronization between a transmited data by a transmitter and received data by the receiver can be done by periodically inserting a fixed sequence into the transmited data.
Moh. Affaf, Zaiful Ulum
core +1 more source
Cross-bifix-free codes within a constant factor of optimality
, 2013 A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization.
Han Mao Kiah +3 more
core
Optimal Prefix-Free Codes for Unequal Letter Costs and Dynamic Programming with the Monge Property
, 1998 The Monge property emerges, sometimes quite mysteriously, in many optimization problems and usually leads to running time improvements of at least a linear factor.
Mordecai J. Golin +3 more
core
Interconnection networks for parallel and distributed computing [PDF]
, 2008 Parallel computers are generally either shared-memory machines or distributed- memory machines. There are currently technological limitations on shared-memory architectures and so parallel computers utilizing a large number of processors tend tube ...
Xiang, Yonghong
core
Frequency Modulation for Asynchronous Data Transfer [PDF]
, 2001 Consider a communication channel that consists of several subchannels transmitting simultaneously and asynchronously. As an example of this scheme, consider a board with two chips (transmitter and receiver).
Bruck, Jehoshua, Mukhtar, Saleem
core
An introduction of greedy extension sets for the application on fix free codes
, 2015 Apart from the acceleration of the decoding process, the instantaneous decodability of fix-free codes in both directions makes data retrievable by opposite direction decoding in case of transmission errors. Fix-free codes were first introduced in 1956 by
Bodewig, Michael
core
Determining Alternative Protein Isoform Expression Using RNA Sequencing and Mass Spectrometry. [PDF]
STAR Protoc, 2020 Han Y, Wright JM, Lau E, Lam MPY.
europepmc +1 more source
Algorithms for Infinite Huffman-Codes
, 2003 Optimal (minimum cost) binary prefix-free codes for infinite sources with geometrically distributed frequencies, e.g., P = {pi(1 - p)}∞i=0, 0 < p < 1, were first (implicitly) suggested by Golomb over thirty years ago in the context of run-length ...
Golin, Mordecai
core