A Construction for Balancing Non-Binary Sequences Based on Gray Code Prefixes

نویسندگان

  • Elie Ngomseu Mambou
  • Theo G. Swart
چکیده

We introduce a new construction for the balancing of non-binary sequences that make use of Gray codes for prefix coding. Our construction provides full encoding and decoding of sequences, including the prefix. This construction is based on a generalization of Knuth’s parallel balancing approach, which can handle very long information sequences. However, the overall sequence—composed of the information sequence, together with the prefix—must be balanced. This is reminiscent of Knuth’s serial algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel. Keywords—Balanced sequence, DC-free codes, Gray code prefix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The structure of single-track Gray codes

Single-track Gray codes are cyclic Gray codes with codewords of length n, such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the first track. We investigate the structure of such binary codes and show that there is no such code with 2n codewords when n is a power of 2. This implies that the known codes with 2n 2n codewords, when n is ...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Extended Binary Linear Codes from Legendre Sequences

A construction based on Legendre sequences is presented for a doubly-extended binary linear code of length 2p + 2 and dimension p+1. This code has a double circulant structure. For p = 4k +3, we obtain a doubly-even self-dual code. Another construction is given for a class of triply extended rate 1/3 codes of length 3p + 3 and dimension p + 1. For p = 4k + 1, these codes are doubly-even selfort...

متن کامل

Markers to construct DC free (d, k) constrained balanced block codes using Knuth’s inversion

We adapt Knuth’s balancing scheme, which was originally developed for unconstrained binary code words. We present a simple method to balance the NRZ runlength constrained block codes corresponding to (d, k) constrained NRZI sequences. A short marker violating the maximum runlength or k constraint is used to indicate the balancing point for Knuth’s inversion. The marker requires fewer overhead b...

متن کامل

Binary Quasi Equidistant and Reflected Codes in Mixed Numeration Systems

The problem of constructing quasi equidistant and reflected binary Gray code sequences and code in a mixed factorial, Fibonacci and binomial numeration systems is considered in the article. Some combinatorial constructions and machine algorithms synthesis sequences, based on the method of directed enumeration are offered. For selected parameters of sequences all quasi equidistant (for individua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1706.00852  شماره 

صفحات  -

تاریخ انتشار 2017