20 citations · 21 across the 8 of their papers we have counts for
9 papers
Deep Holes of Projective Reed-Solomon Codes
Jun Zhang, Daqing Wan, Krishna Kaipa
Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximum possible length q+1. The classification of deep holes --received words with maximum possible error distanc…
An improvement of the asymptotic Elias bound for non-binary codes
Krishna Kaipa
For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relati…
Deep holes and MDS extensions of Reed-Solomon codes
Krishna Kaipa
We study the problem of classifying deep holes of Reed-Solomon codes. We show that this problem is equivalent to the problem of classifying MDS extensions of Reed-Solomon codes by…
Counting generalized Reed-Solomon codes
Peter Beelen, David Glynn, Tom Høholdt +1
In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We com…
An asymptotic formula in q for the number of [n,k] q-ary MDS codes
Krishna Kaipa
We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.
Automorphism groups of Grassmann codes
Sudhir R. Ghorpade, Krishna V. Kaipa
We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the automorphism group of Grassmann codes. Further, we analyze the automorphisms of the…