Loading...
Please wait, while we are loading the content...
Similar Documents
S E Mr Сибирские Электронные Математические Известия Ranks of Propelinear Perfect Binary Codes
| Content Provider | Semantic Scholar |
|---|---|
| Author | S. E © M. R. Issn Электронные, Сибирские Известия, Математические |
| Copyright Year | 2013 |
| Abstract | It is proven that for any numbers n = 2 − 1,m ≥ 4 and r, such that n − log(n + 1) ≤ r ≤ n excluding n = r = 63, n = 127, r ∈ {126, 127} and n = r = 2047 there exists a propelinear perfect binary code of length n and rank r. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.researchgate.net/profile/I_Mogilnykh/publication/236876746_Ranks_of_propelinear_perfect_binary_codes/links/00b7d52b3eddb4ebd8000000.pdf |
| Alternate Webpage(s) | http://semr.math.nsc.ru/v10/p443-449.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |