By Topic

A (48, 31, 8) linear code (Corresp.)

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

2 Author(s)

In this paper we construct a linear code having length 48, minimum distance 8, and containing 2^{31} codewords. This code is obtained by augmenting a (48,22,8) linear code with 2^9 - 1 cosets so that the minimum distance is not reduced. The (48,22,8) code used is the direct product of a (16,11,4) extended Hamming code and a (3,2,2) single-parity-check code. The new code has twice as many codewords as the best linear or nonlinear code previously known.

Published in:

IEEE Transactions on Information Theory  (Volume:19 ,  Issue: 5 )