发布求助
文献互助 智能选刊 最新文献

Problems of Information Transmission最新文献

筛选
英文 中文
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes 分离码和完全分离码速率的改进上界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-07-01 DOI: 10.1134/S0032946022030048
V. I. Vorob'ev, V. Lebedev
{"title":"Improved Upper Bounds for the Rate of Separating and Completely Separating Codes","authors":"V. I. Vorob'ev, V. Lebedev","doi":"10.1134/S0032946022030048","DOIUrl":"https://doi.org/10.1134/S0032946022030048","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47234542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method 基于FEE方法的初等代数和反函数快速求值算法
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-07-01 DOI: 10.1134/S0032946022030085
E. A. Karatsuba
{"title":"Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method","authors":"E. A. Karatsuba","doi":"10.1134/S0032946022030085","DOIUrl":"https://doi.org/10.1134/S0032946022030085","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41261451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs 随机超图着色性质的阈值概率界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-10 DOI: 10.1134/s0032946022010057
A. S. Semenov, D. A. Shabanov
{"title":"Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs","authors":"A. S. Semenov, D. A. Shabanov","doi":"10.1134/s0032946022010057","DOIUrl":"https://doi.org/10.1134/s0032946022010057","url":null,"abstract":"<p>We study the threshold probability for the property of existence of a special-form <span>(r)</span>⁠-⁠coloring for a random <span>(k)</span>⁠-⁠uniform hypergraph in the <span>(H(n,k,p))</span> binomial model. A parametric set of <span>(j)</span>⁠-⁠chromatic numbers of a random hypergraph is considered. A coloring of hypergraph vertices is said to be <span>(j)</span>⁠-⁠proper if every edge in it contains no more than <span>(j)</span> vertices of each color. We analyze the question of finding the sharp threshold probability of existence of a <span>(j)</span>⁠-⁠proper <span>(r)</span>⁠-⁠coloring for <span>(H(n,k,p))</span>. Using the second moment method, we obtain rather tight bounds for this probability provided that <span>(k)</span> and <span>(j)</span> are large as compared to <span>(r)</span>.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138516968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group 基于一般仿射群正则子群的q元线性完美码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-10 DOI: 10.1134/s0032946022010045
I. Yu. Mogilnykh
{"title":"On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group","authors":"I. Yu. Mogilnykh","doi":"10.1134/s0032946022010045","DOIUrl":"https://doi.org/10.1134/s0032946022010045","url":null,"abstract":"<p>A code is said to be propelinear if its automorphism group contains a subgroup acting on its codewords regularly. A subgroup of the group <span>(GA(r,q))</span> of affine transformations is said to be regular if it acts regularly on vectors of <span>(mathbb{F}_q^r)</span>. Every automorphism of a regular subgroup of the general affine group <span>(GA(r,q))</span> induces a permutation on the cosets of the Hamming code of length <span>(frac{q^r-1}{q-1})</span>. Based on this permutation, we propose a construction of <span>(q)</span>⁠-⁠ary propelinear perfect codes of length <span>(frac{q^{r+1}-1}{q-1})</span>. In particular, for any prime <span>(q)</span> we obtain an infinite series of almost full rank <span>(q)</span>⁠-⁠ary propelinear perfect codes.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138494950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Geometric Interpretation of Entropy for Dyck Systems Dyck系统熵的几何解释
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-01 DOI: 10.1134/S0032946022020041
G. D. Dvorkin
{"title":"Geometric Interpretation of Entropy for Dyck Systems","authors":"G. D. Dvorkin","doi":"10.1134/S0032946022020041","DOIUrl":"https://doi.org/10.1134/S0032946022020041","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42940055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding 基于抗错编码的非对称密码学新问题研究
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-01 DOI: 10.1134/S0032946022020077
V. Zyablov, F. Ivanov, E. Krouk, V. Sidorenko
{"title":"On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding","authors":"V. Zyablov, F. Ivanov, E. Krouk, V. Sidorenko","doi":"10.1134/S0032946022020077","DOIUrl":"https://doi.org/10.1134/S0032946022020077","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44845941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Poissonian Two-Armed Bandit: A New Approach Poissonian双臂强盗：一种新方法
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-01 DOI: 10.1134/S0032946022020065
A. Kolnogorov
{"title":"Poissonian Two-Armed Bandit: A New Approach","authors":"A. Kolnogorov","doi":"10.1134/S0032946022020065","DOIUrl":"https://doi.org/10.1134/S0032946022020065","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41912612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound 弱可解析块设计和满足Johnson界的非二进制码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-01 DOI: 10.1134/S003294602201001X
L. Bassalygo, V. Zinoviev, V. Lebedev
{"title":"Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound","authors":"L. Bassalygo, V. Zinoviev, V. Lebedev","doi":"10.1134/S003294602201001X","DOIUrl":"https://doi.org/10.1134/S003294602201001X","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64160762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multi-twisted Additive Codes with Complementary Duals over Finite Fields 有限域上具有互补对偶的多重扭曲加性码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-01 DOI: 10.1134/S0032946022010033
S. Sharma, A. Sharma
{"title":"Multi-twisted Additive Codes with Complementary Duals over Finite Fields","authors":"S. Sharma, A. Sharma","doi":"10.1134/S0032946022010033","DOIUrl":"https://doi.org/10.1134/S0032946022010033","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45526000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Reduction of Recursive Filters to Representations by Sparse Matrices 用稀疏矩阵表示递归滤波器
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2022-04-01 DOI: 10.1134/S0032946022010021
A. Barinov
{"title":"Reduction of Recursive Filters to Representations by Sparse Matrices","authors":"A. Barinov","doi":"10.1134/S0032946022010021","DOIUrl":"https://doi.org/10.1134/S0032946022010021","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47161228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信