scientific article; zbMATH DE number 3859036

zbMATH Open0539.94027MaRDI QIDQ3328458FDOQ3328458

Authors:

Publication date: 1981

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3861057
• Arithmetic of binary finite fields
• Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• A survey on normal bases over finite fields

zbMATH Keywords

Reed-Solomon codesmodular arithmeticnormal basespolynomial operationsGalois fieldbinary logicarithmetic of finite fieldshigh-speed decoding

Mathematics Subject Classification ID

Cyclic codes (94B15) Arithmetic theory of polynomial rings over finite fields (11T55)

Cited In (14)

• Some minimal cyclic codes over finite fields
• Title not available (Why is that?)
• Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
• Arithmetic of binary finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theoretical bases, methods, and processors for transforming information in Galois field codes on the basis of the vertical information technology
• Title not available (Why is that?)
• Cyclotomy and its application to duadic codes
• Circular codes, loop counting, and zeta-functions
• Cyclic Codes and Reducible Additive Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328458)