Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
A technique is presented for constructing cyclic codes that retain many of the combinatorial properties of finite-geometry codes, but are often superior to geometry codes. It is shown that L-step orthogonalization is applicable to certain subclasses of these codes.
Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann
Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann
Electrical Engineering and Computer Science - Technical Reports
A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.
Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi
Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi
Electrical Engineering and Computer Science - Technical Reports
The "best-match problem" is concerned with the complexity of finding the best match between a randomly chosen query word and the members of a randomly chosen set of data words. Of principal interest is whether it is possible to significantly reduce the search time required, as compared to exhaustive comparison, by use of memory redundancy (file structure). Minskv and Papert conjecture that "the speed-up values of large memory redundancies is very small, and for large data sets with long word lengths there are no practical alternatives to large searches that inspect large parts of memory". For this report we present …