3373 search results - page 19 / 675 » Linear transformations on codes |
141
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
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...
152
click to vote
TOG
2002
15 years 5 months ago
2002
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
137
click to vote
DM
2007
15 years 6 months ago
2007
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...
146
click to vote
VTC
2007
IEEE
16 years 10 days ago
2007
IEEE
— We design a coding scheme for Costa’s dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC cha...
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
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...