A NEW UPPER BOUND ON CODES DECODABLE INTO SIZE-2 LISTS A.Ashikhmin

@inproceedings{ANU,
  title={A NEW UPPER BOUND ON CODES DECODABLE INTO SIZE-2 LISTS A.Ashikhmin},
  author={}
}
    A new asymptotic upper bound on the size of binary codes with the property described in the title is derived. The proof relies on the properties of the distance distribution of binary codes established in earlier related works of the authors. Research done while visiting DIMACS Center, Rutgers University, Piscataway, NJ 08854 1 

    From This Paper

    Figures, tables, and topics from this paper.

    References

    Publications referenced by this paper.
    Showing 1-10 of 11 references

    Bounds for codes decodable in a list of nite size. Problems of Information Transmission, 22(1):11{25

    • V. Blinovsky
    • 1986
    Highly Influential
    4 Excerpts

    List decoding for noisy channels

    • P. Elias
    • Rep. No. 335 Research Laboratory of Electronics…
    • 1957
    Highly Influential
    3 Excerpts

    Asymptotic Combinatorial Coding Theory

    • V. Blinovsky
    • 1997
    1 Excerpt

    Channel capacities for list codes

    • R. Ahlswede
    • J. Appl. Probability,
    • 1973
    1 Excerpt

    Similar Papers

    Loading similar papers…