Constant weight codes based on ideals of commutative rings

Ghatak, Anirban (2011) Constant weight codes based on ideals of commutative rings. In: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 5-7 Oct. 2011, Budapest, Hungary.

PDF Constant_Weight.pdf - Published Version Restricted to Registered users only Download (221kB) | Request a copy

Abstract

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme is based on the uniqueness of the primary decomposition of ideals in Noetherian rings. The source alphabet consists of a set of radical ideals constructed from a chosen subset of the prime spectrum of the ring. The distance function between two radical ideals is taken to be the Hamming metric based on the symmetric distance between sets. As an application we construct codes for random networks employing SAF routing.

Item Type:	Conference Poster
Publisher:	IEEE
Additional Information:	Copyright 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	23 Dec 2011 07:24
Last Modified:	23 Dec 2011 07:24
URI:	http://eprints.iisc.ac.in/id/eprint/42856

Actions (login required)

View Item