违反Ashikhmin-Barg界的几类最小二进制线性码

IF 1.1 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2021-05-13 DOI:10.1007/s12095-021-00491-1

E. Pasalic, René Rodríguez, Fengrong Zhang, Yongzhuang Wei

引用次数: 8

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences COMPUTER SCIENCE, THEORY & METHODS-MATHEMATICS, APPLIED

CiteScore

2.50

自引率

7.10%

发文量

期刊介绍： The scope of the journal focuses on discrete structures used in stream and block ciphers in symmetric cryptography; code division multiple access in communications; and random number generation for statistics, cryptography and numerical methods. In particular, papers covering Boolean functions and sequences, without excluding any other discrete structure used in cryptography and communications, such as finite fields and other algebraic structures, are strongly encouraged.