Some new results on majority-logic codes for correction of random errors
The main advantages of random error-correcting majority-logic codes and majority-logic decoding in general are well known and two-fold. Firstly, they offer a partial solution to a classical coding theory problem, that of decoder complexity. Secondly, a majority-logic decoder inherently corrects many...
| Main Author: | |
|---|---|
| Published: |
Loughborough University
1978
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.464525 |
| id |
ndltd-bl.uk-oai-ethos.bl.uk-464525 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-bl.uk-oai-ethos.bl.uk-4645252018-11-08T03:19:52ZSome new results on majority-logic codes for correction of random errorsMcQuilton, David1978The main advantages of random error-correcting majority-logic codes and majority-logic decoding in general are well known and two-fold. Firstly, they offer a partial solution to a classical coding theory problem, that of decoder complexity. Secondly, a majority-logic decoder inherently corrects many more random error patterns than the minimum distance of the code implies is possible. The solution to the decoder complexity is only a partial one because there are circumstances under which a majority-logic decoder is too complex and expensive to implement.005Loughborough Universityhttps://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.464525https://dspace.lboro.ac.uk/2134/34572Electronic Thesis or Dissertation |
| collection |
NDLTD |
| sources |
NDLTD |
| topic |
005 |
| spellingShingle |
005 McQuilton, David Some new results on majority-logic codes for correction of random errors |
| description |
The main advantages of random error-correcting majority-logic codes and majority-logic decoding in general are well known and two-fold. Firstly, they offer a partial solution to a classical coding theory problem, that of decoder complexity. Secondly, a majority-logic decoder inherently corrects many more random error patterns than the minimum distance of the code implies is possible. The solution to the decoder complexity is only a partial one because there are circumstances under which a majority-logic decoder is too complex and expensive to implement. |
| author |
McQuilton, David |
| author_facet |
McQuilton, David |
| author_sort |
McQuilton, David |
| title |
Some new results on majority-logic codes for correction of random errors |
| title_short |
Some new results on majority-logic codes for correction of random errors |
| title_full |
Some new results on majority-logic codes for correction of random errors |
| title_fullStr |
Some new results on majority-logic codes for correction of random errors |
| title_full_unstemmed |
Some new results on majority-logic codes for correction of random errors |
| title_sort |
some new results on majority-logic codes for correction of random errors |
| publisher |
Loughborough University |
| publishDate |
1978 |
| url |
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.464525 |
| work_keys_str_mv |
AT mcquiltondavid somenewresultsonmajoritylogiccodesforcorrectionofrandomerrors |
| _version_ |
1718789544995717120 |