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...
Saved in:
Main Authors | , |
---|---|
Format | Patent |
Language | English |
Published |
23.01.2007
|
Online Access | Get full text |
Cover
Loading…
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. |
---|