On the Basic Averaging Arguments for Linear Codes

This publication has 10 references indexed in Scilit:

• An upper bound on the volume of discrete spheres
  IEEE Transactions on Information Theory, 1994
• The (d,k) subcode of a linear block code
  IEEE Transactions on Information Theory, 1992
• Algebraic-Geometric Codes
  1991
• Algebraic constructions of Shannon codes for regular channels
  IEEE Transactions on Information Theory, 1982
• On the Probability of Undetected Error for Linear Block Codes
  IEEE Transactions on Communications, 1982
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
  Mathematische Nachrichten, 1982
• Linear ensembles of codes (Corresp.)
  IEEE Transactions on Information Theory, 1979
• Universal classes of hash functions
  Journal of Computer and System Sciences, 1979
• Syndrome-source-coding and its universal generalization
  IEEE Transactions on Information Theory, 1976
• An upper bound onk/nfor affine-invariant codes with fixedd/n(Corresp.)
  IEEE Transactions on Information Theory, 1969