m -ary Balanced Codes With Parallel Decoding

An m-ary block code, m = 2, 3, 4,..., of length n ϵ IN is called balanced if, and only if, every codeword is balanced; that is, the real sum of the codeword components, or weight, is equal to ⌊(m - 1)n/2⌋. This paper presents efficient encoding schemes to m-ary balanced codes with parallel (hence, f...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 61; no. 6; pp. 3251 - 3264
Main Authors:	Pelusi, Danilo, Elmougy, Samir, Tallini, Luca G., Bose, Bella
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Balanced codes Coding theory Combinatorics Decoding Electronics Encoding Frequency modulation Indexes Knuth's complementation method m-ary alphabet optical and magnetic recording parallel decoding scheme Redundancy Time complexity unidirectional error detection optical and magnetic recording Balanced codes parallel decoding scheme unidirectional error detection m -ary alphabet Knuth’s complementation method
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!