A. I. Afonina, I. Kayumov, Alexej Nikolaevich Chuprunov
{"title":"关于事件的概率:在$n$广义分配方案中，每个单元的体积不超过$r$","authors":"A. I. Afonina, I. Kayumov, Alexej Nikolaevich Chuprunov","doi":"10.13108/2016-8-2-14","DOIUrl":null,"url":null,"abstract":"We consider n identical generalized schemes of allocating particles in cells. We study the probability of the event: for each generalized allocation scheme, there are at most r particles in each cell, where r is a given number. We obtain an asymptotic estimate for this probability and we consider the application of the obtained results to an antinoise coding.","PeriodicalId":43644,"journal":{"name":"Ufa Mathematical Journal","volume":"61 1","pages":"14-21"},"PeriodicalIF":0.5000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the probability of the event: in $n$ generalized allocation schemes the volume of each cell does not exceed $r$\",\"authors\":\"A. I. Afonina, I. Kayumov, Alexej Nikolaevich Chuprunov\",\"doi\":\"10.13108/2016-8-2-14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider n identical generalized schemes of allocating particles in cells. We study the probability of the event: for each generalized allocation scheme, there are at most r particles in each cell, where r is a given number. We obtain an asymptotic estimate for this probability and we consider the application of the obtained results to an antinoise coding.\",\"PeriodicalId\":43644,\"journal\":{\"name\":\"Ufa Mathematical Journal\",\"volume\":\"61 1\",\"pages\":\"14-21\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ufa Mathematical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.13108/2016-8-2-14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ufa Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13108/2016-8-2-14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
On the probability of the event: in $n$ generalized allocation schemes the volume of each cell does not exceed $r$
We consider n identical generalized schemes of allocating particles in cells. We study the probability of the event: for each generalized allocation scheme, there are at most r particles in each cell, where r is a given number. We obtain an asymptotic estimate for this probability and we consider the application of the obtained results to an antinoise coding.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
