Now showing items 1-3 of 3
A Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithm
This correspondence derives a generalization of the Gilbert- Varshamov bound that is applicable to block codes whose codewords must be drawn from irregular sets; the bound improves by a factor of four a similar result ...
Optical Orthogonal Codes with Unequal Auto- and Cross- Correlation Constraints
An optical orthogonal code (OOC)is collection of binary sequences with good auto-and cross-correlation properties; they were defined by Salehi and others as a means of obtaining code division multiple access on optical ...
Distributed Decoding of Cyclic Block Codes Using a Generalization of Majority-Logic Decoding
One-step majority-logic decoding is one of the simplest algorithms for decoding cyclic block codes. However, it is an effective decoding scheme for very few codes. This paper presents a generalization based on the ...