Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Codes from planar near rings

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
$31 $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

3 Author(s)
Fuchs, P. ; Inst. fuer Math., Linz Univ., Austria ; Hofer, G. ; Pilz, G.

It is well known that error-correcting codes give rise to tactical configurations. Conversely, each such configuration determines four different codes, the codewords being the rows or the columns of the incidence matrix A of the tactical configuration, or the linear hulls generated by the rows or the columns of A. These codes, in particular if the tactical configuration is a block design, are investigated. Several of these codes turn out to be `almost perfect'. The special case in which the balanced incomplete block designs are constructed from planar near rings is also investigated. Special classes of planar near rings (the `circular' ones) that might be especially useful (see J.R. Clay, 1987 and 1988) are investigated

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 3 )