19 search results - page 2 / 4 » On the Duals of Binary Hyper-Kloosterman Codes |
DCC
2001
IEEE
14 years 5 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
When losses occur in a transmission of compressed video, the decoder can attempt to conceal the loss by using spatial or temporal methods to estimate the missing macroblocks. We c...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
APPROX
2009
Springer
14 years 3 days ago
2009
Springer
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...