|
C.8.2 Cooper philosophyComputing syndromes in cyclic code caseCRHT-idealReplace the concrete values above by variables and add some natural restrictions. IntroduceGeneral error-locator polynomial
For an example see Finding the minimum distanceThe method described above can be adapted to find the minimum distance of a code. More concretely, the following holds:
For an example see |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |