首页> 外文期刊>International journal of information and coding theory >A selection of divisible lexicographic codes
【24h】

A selection of divisible lexicographic codes

机译:多种可分解的词典编纂代码

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

摘要

This paper presents a selection of lexicographic codes over a prime field F_p, codes constructed so as to be linear and to have a prescribed minimum distance and divisor. The development of the code when the minimum distance is 3p and the divisor is p leads to questions involving the distribution of quadratic residues and non-residues modulo p. In the course of events, the Hall plane H(p) emerges. This paper is dedicated to Vera Pless on the occasion of her retirement. She was in the audience when I presented a sketchy version of the material at a conference at Lehigh University many years ago. In my enthusiasm, 1 promised her a paper on the subject - and here it is, at last!
机译:本文介绍了在素数字段F_p上的词典编目代码选择,这些代码构造成线性的并具有规定的最小距离和除数。当最小距离为3p且除数为p时,代码的开发引发了涉及二次余数和非余数以p为模的分布的问题。在事件过程中,会出现霍尔平面H(p)。这篇论文是献给维拉·普莱斯(Vera Pless)退休之际的。多年前,我在里海大学(Lehigh University)的一次会议上介绍了该材料的粗略版本时,她在听众面前。 1以我的热情向她答应了一篇关于该主题的论文-终于到了!

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号