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
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
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
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