Back to results
US 2003/0212945 A1Published application
Block coding method having increased flexibility in choice of code length or minimum code distance
AssigneeLucent Technologies Inc.
InventorsGanapathy Subramanian Sundaram, Kartik Swaminathan Venkatram
Life of this patent
Estimating the term…
Abstract
In a method of block coding, each character of the codeword may be thought of as a sum of characters of the message word, computed such that each message-word character that contributes to the sum is weighted by a respective weight coefficient. In the method described here, the weight coefficients are derived from a division polynomial of an elliptic curve.
Claims10
A method, comprising:
- obtaining at least one message word that consists of a finite sequence of characters;
- and
- applying a linear transformation to the message word, thereby to produce a codeword that consists of a finite sequence of characters;
- wherein the linear transformation step comprises, to produce each chracter of the codeword, taking a sum of the characters of the message word, in which each summed character is weighted by a coefficient derived from a division polynomial of an elliptic curve.
1 more element
A method comprising:
- receiving a block-coded communication;
- recovering at least one codeword from the received communication;
- and
- under a predetermined correspondence between codewords and polynomials, testing the codeword for membership in a predetermined ideal of a polynomial ring, thereby to check for error in the codeword.
1 more element
Dependencies are inferred from the claim text.