DMCA
On trellis structures for Reed-Muller codes (1999)
by
Tim Blackmore
,
Graham Norton
| Citations: | 2 - 1 self |
BibTeX
@MISC{Blackmore99ontrellis,
author = {Tim Blackmore and Graham Norton},
title = {On trellis structures for Reed-Muller codes},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study trellises of Reed-Muller codes from first 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 of 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
