Sciweavers

1016 search results - page 13 / 204
» Linear error-block codes
Sort
View
STOC
1995
ACM
88views Algorithms» more  STOC 1995»
13 years 11 months ago
Linear-time encodable and decodable error-correcting codes
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
Daniel A. Spielman
DM
2007
112views more  DM 2007»
13 years 7 months ago
Affine blocking sets, three-dimensional codes and the Griesmer bound
We construct families of three-dimensional linear codes that attain the Griesmer bound and give a probablistic construction of linear codes that are close to the Griesmer bound. Al...
Simeon Ball, Elisa Montanucci
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
An optimal constant-composition or constant-weight code of weight w has linear size if and only if its distance d is at
Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, Sa...