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

2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems最新文献

筛选
英文 中文
About matrices of the local maximum of determinant 关于行列式的局部极大矩阵
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016698
N. A. Balonin, M. Sergeev
{"title":"About matrices of the local maximum of determinant","authors":"N. A. Balonin, M. Sergeev","doi":"10.1109/RED.2014.7016698","DOIUrl":"https://doi.org/10.1109/RED.2014.7016698","url":null,"abstract":"The paper deals with the problem of basic generalizations of Hadamard matrices associated with maximal determinant matrices or not optimal by determinant matrices with orthogonal columns; quasi-orthogonal matrices of the local maximum of determinant have been studied not enough sufficiently. The goal of this paper is to develop theory of such matrices on the preliminary research results. Extreme solutions have been established by minimization of maximum of absolute values of the elements of the matrices followed its subsequent classification according to the quantity of levels and its values depending on orders. The conjecture that there are only five non-trivial and strong optimal low-quantity levels matrices of odd order less than 13 have been proposed. Main types of quasi-orthogonal matrices of the local maximum of determinant (M-matrices) including Mersenne, Fermat, and Euler matrices have been identified and described by its weighing functions. The conjecture accordingly existence of all Mersenne matrices of odd order have been formulated. The question of Mersenne and Hadamard matrices existence is observed Mersenne and Fermat Filters based on the suboptimal by determinant matrices have been used for the masking and image compression.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115158053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Random coding bound for channel with memory-decoding function with finite overlapping 具有有限重叠记忆译码功能信道的随机编码约束
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016712
A. Trofimov
{"title":"Random coding bound for channel with memory-decoding function with finite overlapping","authors":"A. Trofimov","doi":"10.1109/RED.2014.7016712","DOIUrl":"https://doi.org/10.1109/RED.2014.7016712","url":null,"abstract":"We consider a problem of computation of the random coding bound exponent for the finite-state channel model. The mismatched decoding function in the form of the product of the subblock a posteriori probabilities is studied. A numerical example for an intersymbol interference channel is given.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129049943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improved list decoding of tail-biting convolutional codes 改进了咬尾卷积码的列表解码
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016717
Sergei V. Fedorenko, M. Trefilov, Yuejun Wei
{"title":"Improved list decoding of tail-biting convolutional codes","authors":"Sergei V. Fedorenko, M. Trefilov, Yuejun Wei","doi":"10.1109/RED.2014.7016717","DOIUrl":"https://doi.org/10.1109/RED.2014.7016717","url":null,"abstract":"The novel decoding algorithm for the list decoding of tail-biting convolutional codes is described. The main idea is first to estimate the most reliable state from all state spaces for transmitted codeword by using a Soft Input Soft Output decoder, and then to perform the list Viterbi decoding algorithm from this state around the circular tail-biting trellis. For the LTE standard concatenated coding scheme this algorithm provides block error rate performance that is almost the same as for the optimal brute-force list decoding algorithm with significantly less complexity (about 11 times) for list size L=4.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"2 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114115446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Bounds on cardinality of multicomponent network codes 多分量网络码的基数边界
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016694
V. Afanassiev, E. Gabidulin, N. Pilipchuk
{"title":"Bounds on cardinality of multicomponent network codes","authors":"V. Afanassiev, E. Gabidulin, N. Pilipchuk","doi":"10.1109/RED.2014.7016694","DOIUrl":"https://doi.org/10.1109/RED.2014.7016694","url":null,"abstract":"Network coding is a new direction of communications and information theory. Algebraic coding in this area is based on Grassmann metric known also as subspace metric. The paper is devoted to some bounds on cardinality of codes in Grassmann metric.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"33 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134261051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Optimal weighted watermarking for still images 静态图像的最优加权水印
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016714
N. Voloshina, K. Zhidanov, S. Bezzateev
{"title":"Optimal weighted watermarking for still images","authors":"N. Voloshina, K. Zhidanov, S. Bezzateev","doi":"10.1109/RED.2014.7016714","DOIUrl":"https://doi.org/10.1109/RED.2014.7016714","url":null,"abstract":"The secure digital watermarking method for digital images is proposed. This method is based on error correcting codes (ECC) that are perfect in weighted Hamming metric. The usage of perfect ECC guarantees the limited number of errors (distortions of initial image) that occur in watermarking process. The use of ECC that are perfect in weighted Hamming metric increases the efficiency of the watermarking, such as increasing container volume, taking into account specific of human vision system by applying the concept of weighted container. The method of security increasing for weighted watermarking is represented in this paper.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121420575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Coding for S-user vector adder channel s用户矢量加法器信道编码
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016702
A. Frolov
{"title":"Coding for S-user vector adder channel","authors":"A. Frolov","doi":"10.1109/RED.2014.7016702","DOIUrl":"https://doi.org/10.1109/RED.2014.7016702","url":null,"abstract":"The article addresses the problem of constructing a multiple access system for a multi-user vector adder channel (the channel with intensity information or the B-channel). To solve the problem we propose an asynchronous1 coding scheme employing a single-user detection. For the resulting multiple access system we estimate the probability of wrong decoding. Based on this result an asymptotic lower estimate of the relative group rate is derived. The comparisons to the B-channel capacity and to the lower estimate for the A-channel are done.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126878740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Models with common energy harvesting for the random multiple access system 随机多址系统的通用能量收集模型
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016701
S. Foss, Dmitriy Kim, A. Turlikov
{"title":"Models with common energy harvesting for the random multiple access system","authors":"S. Foss, Dmitriy Kim, A. Turlikov","doi":"10.1109/RED.2014.7016701","DOIUrl":"https://doi.org/10.1109/RED.2014.7016701","url":null,"abstract":"We study various models for the classical synchronised multiple access system with a single transmission channel, randomised transmission protocol (ALOHA) and additional common energy supply mechanism: any message requires charging energy for transmission. There are two stochastic renewal inputs to the system, of messages and of energy supply. We study conditions on these inputs for (in)stability of the models and their energy efficiency.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132590830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Low-Density Parity-Check codes based on Partial Unit Memory codes 基于部分单元存储器码的低密度奇偶校验码
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016705
F. Ivanov, V. Zyablov
{"title":"Low-Density Parity-Check codes based on Partial Unit Memory codes","authors":"F. Ivanov, V. Zyablov","doi":"10.1109/RED.2014.7016705","DOIUrl":"https://doi.org/10.1109/RED.2014.7016705","url":null,"abstract":"In this paper we describe ensemble of Low-Density Parity-Check (LDPC) block codes based on Partial Unit Memory (P)UM codes. We study a decoding performance of received ensemble in the case of different parameters of constituent LDPC codes. The results of simulation of obtained code constructions for an iterative “belief propagation” (Sum-Product) decoding algorithm, applied in the case of transmission of a code word via a binary channel with an additive Gaussian white noise and BPSK modulation, are presented.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128518195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Resource allocation algorithm for multiple-access channel 多址信道的资源分配算法
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016700
G. Evseev, A. S. Volodin
{"title":"Resource allocation algorithm for multiple-access channel","authors":"G. Evseev, A. S. Volodin","doi":"10.1109/RED.2014.7016700","DOIUrl":"https://doi.org/10.1109/RED.2014.7016700","url":null,"abstract":"The problem of frequency subchannels allocation between nodes in a common link is considered. It is assumed that every node has an access to a limited subset of subchannels and its requirements to a data rate is known. Under these conditions, subchannels allocation algorithm is proposed.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"47 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116452319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Metrics for distributed systems 分布式系统的度量
2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI: 10.1109/RED.2014.7016708
E. Krouk, A. Ovchinnikov
{"title":"Metrics for distributed systems","authors":"E. Krouk, A. Ovchinnikov","doi":"10.1109/RED.2014.7016708","DOIUrl":"https://doi.org/10.1109/RED.2014.7016708","url":null,"abstract":"In the paper the problem of metric description of processes defined by two-state Markov models is considered. The class of special metrics is presented, the approach of matching the metrics from this class with the Markov models is proposed. In the special case of simple Markov chain the metric matched with Markov chain for large set of its parameters is given. The metric may be used in decision-making tasks in distributed systems.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132165153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信