Open AccessJournal Article
On the Number of Minimum Weight Codewords of Subcodes of Reed-Muller Codes
Reads0
Chats0
About:
This article is published in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.The article was published on 1998-10-25 and is currently open access. It has received 5 citations till now. The article focuses on the topics: Reed–Muller code & Minimum weight.read more
Citations
More filters
Dissertation
Rekursive Codes mit der Plotkin-Konstruktion und ihre Decodierung
TL;DR: In dieser Arbeit werden Codes betrachtet, die allein durch rekursive Anwendung der |u|u+v|-Konstruktion, auch als PLOTKIN-kon Struktion bezeichnet, generiert werde.
Journal ArticleDOI
On Constructions of Reed-Muller Subcodes
TL;DR: In this letter, subcodes constructed from Reed–Muller codes by removal of generator matrix rows are considered, and the greedy algorithm outperforms the three other construction methods, generating the best codes among all presented subcodes.
Proceedings ArticleDOI
On the binary images of (8, 5) shortened cyclic codes over GF(2/sup 8/)
TL;DR: This work considers the binary images of (8, 5) shortened cyclic codes and makes simulation to evaluate the decoding error probabilities by a soft-decision decoding based on ordered statistics for the chosen four sample codes at SNR 2.0 to 5.0.
Journal ArticleDOI
On binary images of shortened cyclic (8, 5) codes over GF(2/sup 8/)
TL;DR: In this paper, a large number of cyclic (8, 5) codes over GF(2/sup 8/) were generated and the weight distributions of the binary images of the codes were computed.
On Binary Images of Shortened Cyclic (8, 5) Codes Over
TL;DR: Simulation results have shown that block error rates of the chosen codes by a soft-decision decoding based on order-2 reprocessing are smaller than those of (64, 40) subcodes of Reed-Muller code by maximum likelihood decoding.