Abstract :
Maximum distance holey packings (MDHPs) of type gn with block size k, MDHP(2,k,n,g)ʹs, are equivalent to optimal (g+1)-ary (n,k,2(k−2)+1) codes. This paper surveys some recent developments concerning MDHPs including new results and various construction techniques. A number of further questions are also discussed.
