Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Problemy Peredachi Informatsii, 1995, Volume 31, Issue 4, Pages 81–99 (Mi ppi295)  
This article is cited in 2 scientific papers (total in 2 papers)

Large Systems

The Best Possible Bounds for Full Rank Probability of a Random Submatroid

V. P. Polesskii
Full-text PDF (1936 kB) Citations (2)
Abstract: We give a new proof of (the sharpest at present) attainable and effectively computable lower bounds for full rank probability of a random submatroid, which were previously obtained by the author. The proof reveals the nature of these bounds and involves majorization theory methods of deriving inequalities in constructing such bounds. The comparison of the obtained bounds with other attainable ones for the characteristic under estimation is given.
Received: 25.11.1994
Revised: 03.02.1995
Bibliographic databases:
Document Type: Article
UDC: 621.395.75:519.2
Language: Russian
Citation: V. P. Polesskii, “The Best Possible Bounds for Full Rank Probability of a Random Submatroid”, Probl. Peredachi Inf., 31:4 (1995), 81–99; Problems Inform. Transmission, 31:4 (1995), 363–379
Citation in format AMSBIB
\Bibitem{Pol95}
\by V.~P.~Polesskii
\paper The Best Possible Bounds for Full Rank Probability of a~Random Submatroid
\jour Probl. Peredachi Inf.
\yr 1995
\vol 31
\issue 4
\pages 81--99
\mathnet{http://mi.mathnet.ru/ppi295}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1367928}
\zmath{https://zbmath.org/?q=an:0895.60107|0862.60099}
\transl
\jour Problems Inform. Transmission
\yr 1995
\vol 31
\issue 4
\pages 363--379
Linking options:
  • https://www.mathnet.ru/eng/ppi295
  • https://www.mathnet.ru/eng/ppi/v31/i4/p81
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:249
    Full-text PDF :112
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024