A new efficient coding scheme is given for second-order spectral-null (2-OSN) codes. The new method applies the Knuth's optimal parallel decoding scheme for balanced (i.e., 1-OSN) codes to the random walk method introduced by Tallini and Bose to design 2-OSN codes. If k IN is the length of a 1-OSN code then the new 2-OSN coding scheme has length n = k+r IN with an extra redundancy of r 2 log2 k + (1/2) log2 log2 k - 0.674 check bits. The whole coding process requires O(n log n) bit operations and 0(n) bit memory elements. © 2013 IEEE.
On efficient second-order spectral-null codes using sets of m 1-balancing functions / R., Mascella; D., Pelusi; Pezza, Laura; S., Elmougy; L. G., Tallini; B., Bose. - ELETTRONICO. - (2013), pp. 141-145. ( 2013 IEEE International Symposium on Information Theory, ISIT 2013 Istanbul, Turkey 7 July 2013 through 12 July 2013) [10.1109/isit.2013.6620204].
On efficient second-order spectral-null codes using sets of m 1-balancing functions
PEZZA, Laura;
2013
Abstract
A new efficient coding scheme is given for second-order spectral-null (2-OSN) codes. The new method applies the Knuth's optimal parallel decoding scheme for balanced (i.e., 1-OSN) codes to the random walk method introduced by Tallini and Bose to design 2-OSN codes. If k IN is the length of a 1-OSN code then the new 2-OSN coding scheme has length n = k+r IN with an extra redundancy of r 2 log2 k + (1/2) log2 log2 k - 0.674 check bits. The whole coding process requires O(n log n) bit operations and 0(n) bit memory elements. © 2013 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
