๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the extendability of code isometries

โœ Scribed by Faina I. Solov'eva; Thomas Honold; Sergei V. Avgustinovich; Werner Heise


Publisher
Springer
Year
1998
Tongue
English
Weight
954 KB
Volume
61
Category
Article
ISSN
0047-2468

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Extendability of Linear Codes
โœ Tatsuya Maruta ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 237 KB

Symposium on Inform. Theory, Whistler, Canada,'' pp. 345) proved that every [n, k, d] O code with gcd(d, q)"1 and with all weights congruent to 0 or d (modulo q) is extendable to an O code with all weights congruent to 0 or d#1 (modulo q). We give another elementary geometrical proof of this theor

On the extendability of steiner t-design
โœ Alphonse H. Baartmans; Ian F. Blake; Vladimir D. Tonchev ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 448 KB

Necessary and sufficient conditions for the extendability of residual designs of Steiner systems S ( t , t + 1, v) are studied. In particular, it is shown that a residual design with respect to a single point is uniquely extendable, and the extendability of a residual design with respect to a pair o

On the Cyclicity of Goppa Codes, Parity-
โœ Thierry P. Berger ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

Classical Goppa codes are a special case of Alternant codes. First we prove that the parity-check subcodes of Goppa codes and the extended Goppa codes are both Alternant codes. Before this paper, all known cyclic Goppa codes were some particular BCH codes. Many families of Goppa codes with a cyclic

New Bounds on the Distance Distribution
โœ Simon Litsyn; Sarit Zur ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

We derive new estimates for the error term in the binomial approximation to the distance distribution of extended Goppa codes. This is an improvement on the earlier bounds by Vladuts and Skorobogatov, and Levy and Litsyn.