Linear complexity in coding theory

Authors:
J. L. Massey;T. Schaub
Affiliations:
Swiss Federal Institute of Technology, Zurich, Switzerland;Landis & Gyr, Switzerland
Venue:
on Coding theory and applications
Year:
1988

Citing 0
Cited 2

On the triple-error-correcting cyclic codes with zero set {1, 2i + 1, 2i + 1}

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract