Показать сокращенную информацию
dc.contributor.author | Kayumov I. | |
dc.contributor.author | Chuprunov A. | |
dc.date.accessioned | 2018-09-18T20:19:28Z | |
dc.date.available | 2018-09-18T20:19:28Z | |
dc.date.issued | 2015 | |
dc.identifier.issn | 1072-3374 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/138720 | |
dc.description.abstract | © 2015, Springer Science+Business Media New York. Let p<inf>nN</inf> be the probability of successful allocation of n groups of particles in N cells with the following assumptions: (a) each group contains m particles and has allocation as a general allocation scheme; (b) each cell contains at most r particles from the same group; (c) events connected with different groups are independent. We obtain an asymptotically exact bound of p<inf>nN</inf> as n,N →∞ such that n/N is bounded. Applications to problems in error-correcting coding are considered. | |
dc.relation.ispartofseries | Journal of Mathematical Sciences (United States) | |
dc.title | The probability of successful allocation of particles in cells (the general case) | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 1 | |
dc.relation.ispartofseries-volume | 209 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 88 | |
dc.source.id | SCOPUS10723374-2015-209-1-SID84938292740 |