首页> 外文期刊>Information Theory, IEEE Transactions on >A Family of $(k+1)$ -Ary Signature Codes for Noisy Multiple-Access Adder Channel
【24h】

A Family of $(k+1)$ -Ary Signature Codes for Noisy Multiple-Access Adder Channel

机译:一系列 $(k + 1)$ -嘈杂的多路访问加法器通道的Ary签名代码

获取原文
获取原文并翻译 | 示例
           

摘要

A coding scheme of -ary error-correcting signature codes for a noisy multiple-access adder channel is proposed. Given a signature matrix and a difference matrix , a larger signature matrix is obtained by replacing each element in the Hadamard matrix with , or , or depending on the values of the elements and their locations in the Hadamard matrix. The set of rows in the proposed matrix gives an error-correcting signature code. Introducing a difference matrix makes it possible to construct an error-correcting signature code whose sum rate is increased with an increase in the order of the Hadamard matrix. Either binary or non-binary signature codes are constructed when the pairs of matrices and are given.
机译:提出了一种用于噪声多址加法器信道的基本纠错签名码的编码方案。给定一个特征矩阵和一个差异矩阵,通过将Hadamard矩阵中的每个元素替换为或,或根据元素的值及其在Hadamard矩阵中的位置来获得更大的特征矩阵。提议的矩阵中的行集提供了一个纠错签名代码。引入差分矩阵使得可以构造纠错签名码,该签名码的总和率随着哈达玛矩阵的阶数的增加而增加。给定矩阵对时,将构造二进制或非二进制签名代码。

著录项

相似文献

  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号