Sciweavers

1579 search results - page 67 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 4 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
TIT
2008
74views more  TIT 2008»
14 years 9 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
ICC
2007
IEEE
117views Communications» more  ICC 2007»
15 years 4 months ago
A Modified Bit-Flipping Decoding Algorithm for Low-Density Parity-Check Codes
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...
Telex Magloire Nkouatchah Ngatched, Fambirai Takaw...
LCPC
2005
Springer
15 years 3 months ago
Analytic Models and Empirical Search: A Hybrid Approach to Code Optimization
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they reflect their implementor’s understanding and beliefs ...
Arkady Epshteyn, María Jesús Garzar&...
CSFW
2012
IEEE
13 years 7 days ago
Information-Flow Security for a Core of JavaScript
—Tracking information flow in dynamic languages remains an important and intricate problem. This paper makes substantial headway toward understanding the main challenges and res...
Daniel Hedin, Andrei Sabelfeld