7 search results - page 1 / 2 » Extension Theorems for Linear Codes over Finite Rings |
AAECC
1997
Springer
13 years 9 months ago
1997
Springer
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
COMBINATORICS
2000
13 years 4 months ago
2000
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
TIT
2011
12 years 11 months ago
2011
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...