Irreducible Cyclic Codes and Polyadic Codes (Paperback)

In this book, explicit expressions of all thegenerating idempotents of irreducible cyclic codes oflength p DEGREESn and 2p DEGREESn over GF(q) are obtained, where pis an oddprime, p does not divide (q DEGREESf-1)/p if n > 1 and f isthe multiplicative order of q modulo p. Also thegenerating idempotents of all theirreducible cyclic codes of length 2 DEGREESn over GF(q), where q is any odd prime power, are determined.It is also proved that the generating idempotents ofirreducible cyclic codes can be effectivelyevaluated, once they are known for irreducible cycliccodes of length prime power length. The weightdistributions of all the irreducible cyclic codes oflength 2 DEGREESn are also obtained directly from theirgenerating polynomials. The necessary and sufficientconditions for the existence of cyclic polyadic codesof prime powerlength and of arbitrary length are obtained. The results on the existence of polyadiccodes, obtained by us, will enable one to constructpolyadic codes of varying lengths and dimensions.Many interesting examples of good codes arise f

General

Imprint:	Lap Lambert Academic Publishing
Country of origin:	Germany
Release date:	June 2011
First published:	June 2011
Authors:	Anuradha Sharma
Dimensions:	229 x 152 x 8mm (L x W x T)
Format:	Paperback - Trade
Pages:	132
ISBN-13:	978-3-8383-9632-3
Categories:	Books > Science & Mathematics > Mathematics > Algebra > General
LSN:	3-8383-9632-4
Barcode:	9783838396323

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!