首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2篇
  免费   0篇
无线电   1篇
冶金工业   1篇
  2000年   1篇
  1976年   1篇
排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
The immunity of Holstein-Friesian dairy cows vaccinated against Coxiella burnetii was challenged with 4 X 10(8) infective guinea pig doses of viable rickettsiae. Cows that were vaccinated had normal full-term calves, whereas 2 nonvaccinated cows aborted late in pregnancy. Intrauterine infection of the fetus was indicated by recovery of the organism from tissues of the fetus. Coxiella burnetii was recovered from milk, colostrum, and placenta of vaccinated and nonvaccinated cows after challenge inoculation, but the rickettsiae recovered were as many as 1,000 times more numerous in nonvacinated cows.  相似文献   
2.
In certain memory systems the most common error is a single error and the next most common error is two errors in positions which are stored physically adjacent in the memory. In this correspondence we present optimal codes for recovering from such errors. We correct single errors and detect double adjacent errors. For detecting adjacent errors we consider codes which are byte-organized. In the binary case, it is clear that the length of the code is at most 2r-r-1, where r is the redundancy of the code. We summarize the known results and some new ones in this case. For the nonbinary case we show an upper bound, called “the pairs bound,” on the length of such code. Over GF(3) codes with bytes of size 2 which attain the bound exist if and only if perfect codes with minimum Hamming distance 5 over GF(3) exist. Over GF(4) codes which attain the bound with byte size 2 exist for all redundancies. For most other parameters we prove the nonexistence of codes which attain the bound  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号