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
Reed-muller transform image coding
β Scribed by B.R.K Reddy; A.L Pai
- Publisher
- Elsevier Science
- Year
- 1988
- Weight
- 96 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0734-189X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
This paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. In the case that the partial:; ordered set is Eulertan the length of the code is the number of elements in the poset, the dimension is the size of a sePected order ideal and the minimum distance is the minimu