RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2008, Volume 44, Issue 1, Pages 38–44 (Mi ppi1264)  

This article is cited in 6 scientific papers (total in 6 papers)

Coding Theory

On the Convexity of One Coding-Theory Function

V. M. Blinovsky

A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: The paper completes the proof of an upper bound for multiple packings in a $q$-ary Hamming space

Full text: PDF file (309 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2008, 44:1, 34–39

Bibliographic databases:

UDC: 621.391.15
Received: 20.11.2007

Citation: V. M. Blinovsky, “On the Convexity of One Coding-Theory Function”, Probl. Peredachi Inf., 44:1 (2008), 38–44; Problems Inform. Transmission, 44:1 (2008), 34–39

Citation in format AMSBIB
\Bibitem{Bli08}
\by V.~M.~Blinovsky
\paper On the Convexity of One Coding-Theory Function
\jour Probl. Peredachi Inf.
\yr 2008
\vol 44
\issue 1
\pages 38--44
\mathnet{http://mi.mathnet.ru/ppi1264}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2416752}
\zmath{https://zbmath.org/?q=an:05357899}
\transl
\jour Problems Inform. Transmission
\yr 2008
\vol 44
\issue 1
\pages 34--39
\crossref{https://doi.org/10.1134/S0032946008010031}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000255537100003}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-44349140213}


Linking options:
  • http://mi.mathnet.ru/eng/ppi1264
  • http://mi.mathnet.ru/eng/ppi/v44/i1/p38

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Guruswami V., Vadhan S., “A Lower Bound on List Size for List Decoding”, IEEE Trans Inform Theory, 56:11 (2010), 5681–5688  crossref  mathscinet  isi  elib
    2. Guruswami V., Hastad J., Kopparty S., “On the List-Decodability of Random Linear Codes”, Stoc 2010: Proceedings of the 2010 Acm Symposium on Theory of Computing, 2010, 409–416  crossref  mathscinet  zmath  isi
    3. Guruswami V., Håstad J., Kopparty S., “On the list-decodability of random linear codes”, IEEE Trans. Inform. Theory, 57:2 (2011), 718–725  crossref  mathscinet  isi  elib
    4. Rudra A., “Limits to list decoding of random codes”, IEEE Trans. Inform. Theory, 57:3 (2011), 1398–1408  crossref  mathscinet  isi  elib
    5. Cheraghchi M. Guruswami V. Velingker A., “Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes”, SIAM J. Comput., 42:5 (2013), 1888–1914  crossref  mathscinet  zmath  isi  elib
    6. Guruswami V. Narayanan S., “Combinatorial Limitations of Average-Radius List-Decoding”, IEEE Trans. Inf. Theory, 60:10 (2014), 5827–5842  crossref  mathscinet  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:221
    Full text:57
    References:35
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019