Abstract
Prior work showed the ability of a randomly chosen outer code of a concatenated code to correct large numbers of nonbinary symbol errors in a simple manner, provided that the error symbols as vectors are linearly independent. This paper extends the technique in two ways: 1) it is shown how to correct a large class of dependent errors with little additional complexity; and 2) if the inner code supplies a list of two (or more) candidates in some or all decisions, a slightly modified vector symbol decoder can directly reveal most correct alternatives, allowing more powerful and often simpler correction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
