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

On the equivalence of linear codes

โœ Scribed by Zihui Liu; Zhimin Sun


Book ID
105867585
Publisher
Springer
Year
2011
Tongue
English
Weight
133 KB
Volume
22
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the reconstruction of linear codes
โœ Philip Maynard; Johannes Siemons ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB ๐Ÿ‘ 2 views

For a linear code over GF (q) we consider two kinds of ''subcodes'' called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstructi

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

Linear transformations on codes
โœ David G. Glynn; T. Aaron Gulliver; Manish K. Gupta ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 271 KB
On the covering radius of cyclic linear
โœ Tor Helleseth ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC

On constructing disjoint linear codes
โœ Zhang, Weiguo ;Cai, Mian ;Xiao, Guozhen ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Higher Education Press and Springer ๐ŸŒ English โš– 144 KB