Bounds on Codes

Serguei A. Stepanov
Additional contact information
Serguei A. Stepanov: Bilkent University

Chapter Chapter 2 in Codes on Algebraic Curves, 1999, pp 25-39 from Springer

Abstract: Abstract We have already explained that a good code should have large d/n andk/nin the unit interval [0,1] for a givenn.From Shannon’s theorem we know also that we should study long codes. However, if the channel has symbol-error probabilitypthen we should expect an average ofpnerrors per received word of lengthn.To correct these we need to have a minimum distance more than2pn.So, if we increasenthendshould increase proportionally.

Keywords: Minimum Distance; Linear Code; Asymptotical Equality; Good Code; Linear Programming Technique (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-4785-3_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461547853

DOI: 10.1007/978-1-4615-4785-3_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().