✦ LIBER ✦

On computing the number of code words with minimum weight for cyclic codes

✍ Scribed by Masami Mohri; Masakatsu Morii

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 264 KB
Volume: 81
Category: Article
ISSN: 1042-0967
DOI: 10.1002/(sici)1520-6440(199808)81:8<83::aid-ecjc9>3.0.co;2-0

No coin nor oath required. For personal study only.

✦ Synopsis

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance measures can be calculated approximately from these. When the number of information points is increased, however, it becomes difficult in general to derive the weight distribution of the code. When the number of check points is increased, it also becomes difficult to derive the weight distribution of the original code word from the dual code. Thus, it is an important issue to reduce computational complexity in the derivation of the weight distribution. It is desired to develop a method that can derive the weight distribution with high speed, or the minimum distance and the number of corresponding code words. Recently, Barg and Dumer [5] proposed a method in which the minimum distance and the number of corresponding code words are determined efficiently, by utilizing the properties of the cyclic code. Even if their method is employed, however, a drastic improvement cannot be expected when the parameters are such that the number of information points is very large, since the number of code searches is not drastically reduced. This paper examines the properties of the cyclic code as well as the method of BargDumer in further detail, and proposes a method that determines efficiently the minimum distance and the number of corresponding code words with higher speed. The proposed method is compared to the method of BargDumer through several numerical experiments, and the usefulness of the proposed method is demonstrated. The conditions under which the proposed methods are effective are investigated.

📜 SIMILAR VOLUMES

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

The optimality of Feng–Rao designed mini

The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order

✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 1 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 1 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t

Coding microbiological data for computer

Coding microbiological data for computers. New York, Berlin, Heidelberg, London, Paris, Tokyo: Springer-Verlag, 1986. Sponsored by the Committee on Data for Science and Technology (CODATA) of the International Union of Scientific Unions (ICSU), 299 pp., 12 fig., DM 80

✍ B. Nagel; L. Brüggemann 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

Sequencing of a 9·9 kb Segment on the Ri

Sequencing of a 9·9 kb Segment on the Right Arm of Yeast Chromosome VII Reveals Four Open Reading Frames, includingPFK1, the Gene Coding for Succinyl-CoA Synthetase (β-chain) and Two ORFs Sharing Homology with ORFs of the Yeast Chromosome VIII

✍ GUERREIRO, PAULO; AZEVEDO, DULCE; BARREIROS, TANIA; RODRIGUES-POUSADA, CLAUDINA 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB 👁 1 views

A 9•9 kb DNA fragment from the right arm of chromosome VII of Saccharomyces cerevisiae has been sequenced and analysed. The sequence contains four open reading frames (ORFs) longer than 100 amino acids. One gene, PFK1, has already been cloned and sequenced and the other one is the probable yeast gen