On codes, ω-codes and ω-generators
✍ Scribed by S. Julia; I. Litovsky; B. Patrou
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 468 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
Up to now, the question "given a rational language R, how to decide if there exists an w-code C such that C" = R"?" remains with no general solution. We give an answer assuming that the greatest w-generator of R" exists and is a free submonoid. In the case where the greatest generator is generated by a three-element code the question was recently solved . We extend the result to the whole class of rational codes.
📜 SIMILAR VOLUMES
In a recent paper we showed how the binary Golay code can be obtained in a revealing way straight from the edge-graph of the icosahedron. This construction not only yields a natural basis for the code, but also supplies a simple description of all codewords. In this paper we show that the above is m
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
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