Method for constructing logic circuits of small depth and complexity for operation of inversion in finite fields of characteristic 2

mnkA method for constructing a logic circuit for inversion in finite field GF(2) is described, where m=nk, and k, n are coprime numbers, using bases in subfields GF(2) and GF(2). The method may be applied to error correction codes, including BCH codes, Reed-Solomon codes (which are a subset of BCH c...

Full description

Saved in:
Bibliographic Details
Main Authors Gashkov, Sergei B, Andreev, Alexander E
Format Patent
LanguageEnglish
Published 23.01.2007
Online AccessGet full text

Cover

More Information
Summary:mnkA method for constructing a logic circuit for inversion in finite field GF(2) is described, where m=nk, and k, n are coprime numbers, using bases in subfields GF(2) and GF(2). The method may be applied to error correction codes, including BCH codes, Reed-Solomon codes (which are a subset of BCH codes), turbo codes, and the like.