The following pages link to Abraham Lempel (Q921086):
Displaying 50 items.
- Factorization of symmetric circulant matrices in finite fields (Q921087) (← links)
- Linear intersecting codes (Q1072521) (← links)
- Characterization and synthesis of self-complementary normal bases in finite fields (Q1096676) (← links)
- (Q1171376) (redirect page) (← links)
- On the complexity of multiplication in finite fields (Q1171378) (← links)
- \(t\)-sum generators of finite Abelian groups (Q1195479) (← links)
- Systematic derivation of spline bases (Q1195761) (← links)
- Cycle decomposition by disjoint transpositions (Q1220515) (← links)
- On encoding and decoding with two-way head machines (Q1346720) (← links)
- m-ary closed sequences (Q2548254) (← links)
- On extremal factors of the de Bruijn graph (Q2553447) (← links)
- (Q3033695) (← links)
- Design of universal test sequences for VLSI (Q3220498) (← links)
- (Q3325625) (← links)
- Algorithms for the generation of full-length shift- register sequences (Q3336716) (← links)
- Two-dimensional encoding by finite-state encoders (Q3472039) (← links)
- On MDS codes via Cauchy matrices (Q3472046) (← links)
- On the distribution of de Bruijn sequences of given complexity (Q3684033) (← links)
- On symmetric algorithms for bilinear forms over finite fields (Q3698312) (← links)
- Construction of de Bruijn sequences of minimal complexity (Q3698698) (← links)
- An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network (Q3718170) (← links)
- (Q3744087) (← links)
- On multiset decipherable codes (Corresp.) (Q3757831) (← links)
- Self-Complementary Normal Bases in Finite Fields (Q3797288) (← links)
- Composition of Reed-Solomon codes and geometric designs (Q3804609) (← links)
- A construction of non-Reed-Solomon type MDS codes (Q3832466) (← links)
- (Q3887342) (← links)
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields (Q3897159) (← links)
- Maximal families of bent sequences (Q3955275) (← links)
- On the power of straight- line computations in finite fields (Q3956397) (← links)
- Explicit formulas for self-complementary normal bases in certain finite fields (Q3981158) (← links)
- Application of circulant matrices to the construction and decoding of linear codes (Q3986488) (← links)
- On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences (Q3990773) (← links)
- A sequential algorithm for the universal coding of finite memory sources (Q4008332) (← links)
- On clique-extremal (p,q)-graphs (Q4067140) (← links)
- Difference codes with desirable spectral properties (Corresp.) (Q4093319) (← links)
- Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$ (Q4096860) (← links)
- On the Complexity of Finite Sequences (Q4105595) (← links)
- On fast M-sequence transforms (Corresp.) (Q4113748) (← links)
- A class of balanced binary sequences with optimal autocorrelation properties (Q4132110) (← links)
- A new approach to error-correcting codes (Q4133530) (← links)
- Second Order Polynomial Recursions (Q4154632) (← links)
- A universal algorithm for sequential data compression (Q4158937) (← links)
- Compression of individual sequences via variable-rate coding (Q4174617) (← links)
- (Q4279521) (← links)
- On ternary complementary sequences (Q4308793) (← links)
- Families of sequences with optimal Hamming-correlation properties (Q4404126) (← links)
- Maximum likelihood decoding of certain Reed - Muller codes (Corresp.) (Q4742704) (← links)
- On Symmetric Representations of Finite Fields (Q4742936) (← links)
- (Q4858446) (← links)
