Abstract
Let S (N,q) be the set of all words of length N over the bipolar alphabet (-1,+1), having a qth order spectral-null at zero frequency. Any subset of S (N,q) is a spectral-null code of length N and order q. This correspondence gives an equivalent formulation of S(N,q) in terms of codes over the binary alphabet (0,1), shows that S(N,2) is equivalent to a well-known class of single-error correcting and all unidirectional-error detecting (SEC-AUED) codes, derives an explicit expression for the redundancy of S(N,2), and presents new efficient recursive design methods for second-order spectral-null codes which are less redundant than the codes found in the literature.
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.
