Reducing Code Length of Second-Order Spectral-Null Code

doi:10.1109/TC.2013.231

Reducing Code Length of Second-Order Spectral-Null Code

2015-02-01

2

PRE

AI

DOI：10.1109/TC.2013.231

Original

Original request for help

Save

Abstract

En 中文

Tallini and Bose defined a random walk function on which an efficient encoding/decoding algorithm for second-order spectral-null (2-OSN) codes was based. Later, Yang enhanced Tallini-Bose code by using quasi 2-OSN codes. Both 2-OSN codes encode the information word into a balanced word and then append extra bits to make the length of this balanced word equal to 0 (or 2) modulo 4. The main innovation is to eliminate the need for appended bits, thereby increasing the code rate.

Keywords:

Second-order spectral-null code

balanced code

dc-free code

Reducing Code Length of Second-Order Spectral-Null Code

Abstract

Journal

Organization