English
Related papers

Related papers: A Construction of Binary Linear Codes from Boolean…

200 papers

Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…

Computational Complexity · Computer Science 2021-07-26 Subhamoy Maitra , Chandra Sekhar Mukherjee , Pantelimon Stanica , Deng Tang

One of the major issues of cryptography is the cryptanalysis of cipher algorithms. Cryptanalysis is the study of methods for obtaining the meaning of encrypted information, without access to the secret information that is normally required.…

Cryptography and Security · Computer Science 2016-09-14 Michel Dubois , Eric Filiol

In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present four…

Information Theory · Computer Science 2020-12-08 Xia Wu , Wei Lu , Xiwang Cao

We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…

Information Theory · Computer Science 2019-06-25 Mohammad Vahid Jamali , Mahdi Soleymani , Hessam Mahdavifar

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Information Theory · Computer Science 2016-02-03 Fei Li , Yang Yan , Qiuyan Wang , Tongjiang Yan

Binary code analysis plays a pivotal role in the field of software security and is widely used in tasks such as software maintenance, malware detection, software vulnerability discovery, patch analysis, etc. However, unlike source code,…

Software Engineering · Computer Science 2025-05-01 Xiuwei Shang , Zhenkan Fu , Shaoyin Cheng , Guoqiang Chen , Gangyang Li , Li Hu , Weiming Zhang , Nenghai Yu

This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the…

Information Theory · Computer Science 2009-04-14 Vaneet Aggarwal , A. Robert Calderbank

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…

Information Theory · Computer Science 2015-10-20 Zhengchun Zhou , Nian Li , Cuiling Fan , Tor Helleseth

In this paper, we study nonlinear differential equations satisfied by the generating function of Boole numbers. In addition, we derive some explicit and new interesting identities involving Boole numbers and higher-order numbers arising…

Number Theory · Mathematics 2016-03-28 Taekyun Kim , Dae San Kim

Boolean functions can be represented in many ways including logical forms, truth tables, and polynomials. Additionally, Boolean functions have different canonical representations such as minimal disjunctive normal forms. Other canonical…

Computational Complexity · Computer Science 2024-11-19 Elena Dimitrova , Brandilyn Stigler , Claus Kadelka , David Murrugarra

We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-$k$-times Branching Programs or Ordered Binary Decision Diagrams with repeated test ($k$-QOBDD, $k$-NOBDD and $k$-POBDD). We show…

Computational Complexity · Computer Science 2017-03-24 Kamil Khadiev , Rishat Ibrahimov

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use the Groebner bases to decode these codes.

Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…

Information Theory · Computer Science 2015-08-17 Chunming Tang , Nian Li , Yanfeng Qi , Zhengchun Zhou , Tor Helleseth

Boolean networks have been used in a variety of settings, as models for general complex systems as well as models of specific systems in diverse fields, such as biology, engineering, and computer science. Traditionally, their properties as…

Dynamical Systems · Mathematics 2024-02-02 Matthew Wheeler , Claus Kadelka , Alan Veliz-Cuba , David Murrugarra , Reinhard Laubenbacher

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of…

Information Theory · Computer Science 2019-11-21 Sihem Mesnager , Yanfeng Qi , Hongming Ru , Chunming Tang

Recently, Linear Complementary Dual (LCD) codes have garnered substantial interest within coding theory research due to their diverse applications and favorable attributes. This paper directs its attention to the construction of binary and…

Information Theory · Computer Science 2024-09-13 Yansheng Wu , Jin Ma , Shandong Yang

Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…

Information Theory · Computer Science 2019-01-18 Minglong Qi , Shengwu Xiong

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou

Let $m$ be an even positive integer. A Boolean bent function $f$ on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $\epsilon \in \GF{}$, $f(ax_1,x_2)+f(bx_1,x_2+\epsilon)$ is always…

Information Theory · Computer Science 2018-11-20 Cunsheng Ding , Sihem Mesnager , Chunming Tang , Maosheng Xiong