IEEE Transactions on Information Theory · 1998 · 119 citations · 14 references
EngineeringCommunicationElectrical EngineeringDigital CommunicationInformation TheoryWireless CommunicationsCommunication ComplexityComputational ComplexityMultiple Access TechniquesSpread Spectrum CommunicationCodes Over Finite RingsComplexityFrequency HoppingFrequency-hopping Spread SpectrumHamming DistanceLinear ComplexityResidue Class RepresentationSpreading Codes
We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spread-spectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger (1974) bound. The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields.
14
Modular andp-adic cyclic codes
A.R. Calderbank, N. J. A. Sloane · Designs Codes and Cryptography · 1995 · 337 citations
Spread-spectrum communications
H. Schreiber · Proceedings of the IEEE · 1985 · 314 citations