✦ LIBER ✦

On Trellis Structures for Reed–Muller Codes

✍ Scribed by Tim Blackmore; Graham H. Norton

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 254 KB
Volume: 6
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1999.0265

No coin nor oath required. For personal study only.

✦ Synopsis

We study trellises of Reed}Muller codes from "rst principles. Our approach to local trellis behaviour seems to be new and yields amongst other things another proof of a result of Berger and Be'ery on the state complexity of Reed}Muller codes. We give a general form of a minimal-span generator matrix for the family of Reed}Muller codes with their standard bit-order. We apply this to determining the number of parallel subtrellises in any uniform sectionalisation of a Reed}Muller code and to designing trellises for Reed}Muller codes with more parallel subtrellises than the minimal trellis, but with the same state complexity.

📜 SIMILAR VOLUMES

On the Reed-Muller codes

✍ E.F. Assmus Jr 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 632 KB

Assmus Jr, E.F., On the Reed-Muller codes, Discrete Mathematics 106/107 (1992) 25-33. We give a brief but complete account of all the essential facts concerning the Reed-Muller and punctured Reed-Muller codes. The treatment is new and includes an easy, direct proof of the fact that the punctured R

On the covering radius of Reed-Muller co

On the covering radius of Reed-Muller codes

✍ Gérard D. Cohen; Simon N. Litsyn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 371 KB

We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea

Orphan structure of the first-order Reed

Orphan structure of the first-order Reed-Muller codes

✍ Richard A. Brualdi; Ning Cai; Vera S. Pless 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 563 KB

A tutorial on Reed–Solomon coding for fa

A tutorial on Reed–Solomon coding for fault-tolerance in RAID-like systems

✍ James S. Plank 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

It is well-known that Reed-Solomon codes may be used to provide error correction for multiple failures in RAID-like systems. The coding technique itself, however, is not as well-known. To the coding theorist, this technique is a straightforward extension to a basic coding paradigm and needs no speci

Design criteria for space-time trellis c

Design criteria for space-time trellis codes based on product distance distribution and trace distribution in fast fading channels

✍ Yukihiro Sasazaki; Tomoaki Ohtsuki 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 487 KB

Letter: Opportunistic channel for sendin

Letter: Opportunistic channel for sending an extra 300 bit/s using a trellis coded modulation scheme which transmits 9.6 kbit/s on telephone lines

✍ Sterian, Corneliu-Eugen D. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

It is shown that the TCM scheme with 8-D rectangular constellation designed by Tretter [I] based on a well known method invented by Wei [2] can support an opportunistic channel which can transmit 300 bitds.