Sciweavers

1579 search results - page 18 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
LCTRTS
2005
Springer
15 years 3 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...
FOCS
2009
IEEE
15 years 4 months ago
Constructing Small-Bias Sets from Algebraic-Geometric Codes
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
Avraham Ben-Aroya, Amnon Ta-Shma
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 9 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
SIGOPSE
2004
ACM
15 years 3 months ago
Constructing component-based extension interfaces in legacy systems code
Implementing an extension of a legacy operating system requires knowing what functionalities the extension should provide and how the extension should be integrated with the legac...
Gilles Muller, Julia L. Lawall, Jean-Marc Menaud, ...
TIT
2010
103views Education» more  TIT 2010»
14 years 4 months ago
Knuth's balanced codes revisited
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
Jos H. Weber, Kees A. Schouhamer Immink