1016 search results - page 60 / 204 » Linear error-block codes |
177
click to vote
SIAMDM
2010
15 years 4 months ago
2010
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...
117
Voted
ICASSP
2008
IEEE
16 years 14 days ago
2008
IEEE
In this paper, a new approach for decoding real-field codes based on finding sparse solutions of underdetermined linear systems is proposed. This algorithm iteratively estimates...
121
click to vote
IMA
2001
Springer
15 years 10 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
163
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
An algorithm for efficient encoding of LDPC codes is presented that does not impose any restrictions on the construction of the parity-check matrices. The algorithm modifies the pa...
152
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...