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.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:464525 |
| Date | January 1978 |
| Creators | McQuilton, David |
| Publisher | Loughborough University |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | https://dspace.lboro.ac.uk/2134/34572 |
Page generated in 0.0024 seconds