Sciweavers

1579 search results - page 25 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
SIAMDM
2010
137views more  SIAMDM 2010»
14 years 8 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
TIT
2010
170views Education» more  TIT 2010»
14 years 4 months ago
Correcting charge-constrained errors in the rank-modulation scheme
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck
CATS
2006
14 years 11 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
79
Voted
CODES
1999
IEEE
15 years 2 months ago
Co-design tool construction using APICES
In this paper, we present our approach to automate the development process of co-design tools. We demonstrate with a non-trivial real world example how we can accelerate the tool ...
Ansgar Bredenfeld
ECCC
2010
91views more  ECCC 2010»
14 years 9 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan