A Epistle on an Upper Bound for (n,d)

KHARVI SANDEEP

Research Article

A Epistle on an Upper Bound for (n,d)

Paper ID 43
Volume 2, Issue 5
Pages 10-11
Published Online: September-October 2021
1 Views

Open Access Peer Reviewed

Authors

KHARVI SANDEEP¹

¹² Asst Prof, Dept. of mathematics, Sai Vidya Institute of Technology, Karnataka, India.

View PDF Download PDF Cite this article

Article Information

DOI: No DOI
Published In: Volume 2, Issue 5 (2021)
Published Online: September-October 2021
Pages: 10-11
Article Type: Research Article
Check for updates: No DOI available for cross-reference

References

[1] Carry HuffmanandVerapless,Fundamentalsof ErrorsCorrectingCodesCambridgeUniversitypress,FirstsouthAsianEdition(2004)
[2] L.L.Donhoffand F.E.Hohn,Chapter2 page53-57 Applied ModernAlgebraMacmillanpub toNY(1978)
[3] P.Delsarte,Boundsforunrestrictedcodesby linearprogramming PhilipsResearch Report27 (1972),272-289.
[4] P.P.Greenough,searchingforoptimallinearcodes,M.ScThesis,Universityof Salford,1991.
[5] R.Hill,Optimallinearcodesinproceedingandofsecond IMAconferenceonCryptography and coding(oxforduniversitypress)toappear
[6] R.HillandD.E.Newton,Someoptimalternarylinearcodes,Arscombinatoria25A(1988),61-72
[7] R.HillandD.E.Newton,Optimalternarylinearcodes,toappear inDesign,codesandCryptography
T.Verhoeff,Anupdatedtableofminimumdistanceboundsforbinary linearcodesIEEE Trans.Info.Theory ,IT-33(1987)665-68

A Epistle on an Upper Bound for (n,d)

Article Information

References

Related Articles