By Topic

Comma-free error-correcting codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A method is shown by which it is possible to establish the existence (or nonexistence) of the comma-free properties of any group code from a simple observation of its null-space. Using this technique it is then demonstrated that all (n, k) {em cyclic} group error-correcting code dictionaries can be made comma-free (without adding further redundancy or altering their error-correcting properties) if, and only if, k \leq (n - 1)/2 . If k is larger than (n - 1)/2 it is still possible to detect bit gains or losses of up to n-k-1 code bits.

Published in:

IEEE Transactions on Information Theory  (Volume:11 ,  Issue: 1 )