Results 1  10
of
1,281
LOSSLESS COMPRESSION AND ALPHABET SIZE
, 2006
"... Lossless data compression through exploiting redundancy in a sequence of symbols is a wellstudied field in computer science and information theory. One way to achieve compression is to statistically model the data and estimate model parameters. In practice, most general purpose data compression alg ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the symbols of the source are encoded into bit sequences of variable length. Throughout this thesis, we assume that the source alphabet consists of blocks of equal size of elementary symbols (typically bits), and address the impact of this
Alphabet Sizes of Auxiliary Variables in Canonical Inner Bounds
, 2008
"... Alphabet size of auxiliary random variables in our canonical description is derived. Our analysis improves upon estimates known in special cases, and generalizes to an arbitrary multiterminal setup. The salient steps include decomposition of constituent rate polytopes into orthants, translation of a ..."
Abstract
 Add to MetaCart
Alphabet size of auxiliary random variables in our canonical description is derived. Our analysis improves upon estimates known in special cases, and generalizes to an arbitrary multiterminal setup. The salient steps include decomposition of constituent rate polytopes into orthants, translation
Improving the alphabetsize in expander based code constructions.
"... Various code constructions use expander graphs to improve the error resilience. Often the use of expanding graphs comes at the expense of the alphabet size. This is the case, e.g., in [1], [9] and [7]. We show that by replacing the balanced expanding graphs used in the above constructions with unbal ..."
Abstract
 Add to MetaCart
Various code constructions use expander graphs to improve the error resilience. Often the use of expanding graphs comes at the expense of the alphabet size. This is the case, e.g., in [1], [9] and [7]. We show that by replacing the balanced expanding graphs used in the above constructions
On Average Throughput and Alphabet Size in Network Coding
 IEEE TRANSACTION ON INFORMATION THEORY (TO APPEAR)
, 2005
"... We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP for ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
throughput measures in networks, and show how in certain classes of networks, average throughput bounds can be translated into minimum throughput bounds, by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially
Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size
"... An erasure channel with an arbitrary alphabet size q is studied. It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Next, based on the performance of MDS codes, a ..."
Abstract
 Add to MetaCart
An erasure channel with an arbitrary alphabet size q is studied. It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Next, based on the performance of MDS codes
Symmetric Tardos ngerprinting codes for arbitrary alphabet sizes
"... Fingerprinting provides a means of tracing unauthorized redistribution of digital data by individually marking each authorized copy with a personalized serial number. In order to prevent a group of users from collectively escaping identication, collusionsecure ngerprinting codes have been proposed. ..."
Abstract
 Add to MetaCart
. In this paper, we introduce a new construction of a collusionsecure ngerprinting code which is similar to a recent construction by Tardos but achieves shorter code lengths and allows for codes over arbitrary alphabets. For binary alphabets, n users and a false accusation probability of , a code length of m 2
Statistical mechanics of RNA folding: Importance of alphabet size
"... We construct a basestacking model of RNA secondarystructure formation and use it to study the mapping from sequence to structure. There are strong, qualitative differences between twoletter and fouror sixletter alphabets. With only two kinds of bases, most sequences have many alternative foldi ..."
Abstract
 Add to MetaCart
We construct a basestacking model of RNA secondarystructure formation and use it to study the mapping from sequence to structure. There are strong, qualitative differences between twoletter and fouror sixletter alphabets. With only two kinds of bases, most sequences have many alternative
Coding over an Erasure Channel with a Large Alphabet Size
, 2008
"... An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied. It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied. It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure
1 Nearly MDS expander codes with reduced alphabet size
, 708
"... Abstract — Recently, Roth and Skachek proposed two methods for constructing nearly maximumdistance separable (MDS) expander codes. We show that through the simple modification of using mixedalphabet codes derived from MDS codes as constituent codes in their code designs, one can obtain nearly MDS ..."
Abstract
 Add to MetaCart
codes of significantly smaller alphabet size, albeit at the expense of a (very slight) reduction in code rate. Index Terms — Expander codes, lineartime encodable and decodable codes, maximumdistanceseparable codes, mixedalphabet codes I.
Results 1  10
of
1,281