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
An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph
An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive to high rate codes. Examples are given for both block and convolutional codes.
Two Models For Combinatory Logic, Luis E. Sanchis
Two Models For Combinatory Logic, Luis E. Sanchis
Electrical Engineering and Computer Science - Technical Reports
We consider in this paper two models of combinatoric logic in which the domain is the same : P(N) the power set of N = the set of non negative integers.
Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang
Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang
Electrical Engineering and Computer Science - Technical Reports
In this work we investigate the weight structure of cyclic codes of composite length n = n1n2, where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cyclic codes.