Quintic Irreducible Binary Goppa Codes of Length 32

Quintic Irreducible Binary Goppa Codes of Length 32


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 3,651

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

Goppa codes are a class of linear codes and have a well defined algebraic structure. They are considered to be very close to random codes and form the basis of the Mc Eliece public key cryptosystem. Their true minimum distance and dimension are still not known. Neither do we know which choices of Goppa polynomials give rise to codes with better minimum distance. In this book we give an exact count of quintic irreducible Goppa codes of length 32 and their extended versions. We also present an instance of the problem of true minimum distance and choice of a Goppa polynomial. Apart from this, we give an example to show that the well known sufficient condition for two Goppa codes to be equivalent is not a necessary condition. We point out that it is possible to get such an example from among the degenerate codes but we show that the example we give is taken from the non-degenerate codes. We then give a count of degenerate and non degenerate codes.

Product Specifications
SKU :COC24703
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-28
0 Review(s)