Search Results - "binary linear code"

A class of cubic polynomial semi-bent functions over F2n by Wang, Yan-Ping, Zha, Zhengbang, Zhang, Weiguo, Feng, Dengguo

“…Semi-bent functions play an important role in coding theory, symmetric ciphers, and sequence designs. In this paper, by decomposing cubic Boolean functions and…”
Get full text

Optimal minimal linear codes from posets by Hyun, Jong Yoon, Kim, Hyun Kwang, Wu, Yansheng, Yue, Qin

“…Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this…”
Get full text

Several classes of wide minimal binary linear codes based on general Maiorana-McFarland class by Du, Xiaoni, Gao, Siqi, Yuan, Wenping, Qiao, Xingbin

“…Minimal linear codes have important applications in secret sharing schemes and secure two-party computation. In this paper, we extend the construction of wide…”
Get full text

Three New Families of Binary AFER-Optimal Linear Codes by Tong, Tingting, Hu, Sihuang

“…The error coefficient of a linear code, defined as the number of its minimum weight codewords, is a key performance metric to evaluate codes with a given…”
Get full text

Embedding Linear Codes Into Self-Orthogonal Codes and Their Optimal Minimum Distances by Kim, Jon-Lark, Kim, Young-Hun, Lee, Nari

“…We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which…”
Get full text

Self-Orthogonality Matrix and Reed-Muller Codes by Kim, Jon-Lark, Choi, Whan-Hyuk

“…Kim et al. (2021) gave a method to embed a given binary <inline-formula> <tex-math notation="LaTeX">[n,k] </tex-math></inline-formula> code <inline-formula>…”
Get full text

A Class of Binary Codes Using a Specific Automorphism Group by Harzalla, Driss

“…In this article, we showcase PSL(3,4) as the automorphism group for a specific class of three linear binary codes, C1, C2 and C3, with dimension 9. The…”
Get full text

Self-Orthogonal Codes Constructed from Posets and Their Applications in Quantum Communication by Wu, Yansheng, Lee, Yoonjin

“…It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum…”
Get full text

Several classes of binary linear codes and their weight enumerators by Li, Fei, Yan, Yang, Wang, Qiuyan, Yan, Tongjiang

“…In the past decades, linear codes with a few weights have been extensively studied for their applications in space communication, data storage and cryptography…”
Get full text

Private Searching on Streaming Data Based on Keyword Frequency by Xun Yi, Bertino, Elisa, Vaidya, Jaideep, Chaoping Xing

“…Private searching on streaming data is a process to dispatch to a public server a program, which searches streaming sources of data without revealing searching…”
Get full text

Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials by Goldberg, Leslie Ann, Jerrum, Mark

“…We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary…”
Get full text

On The Classification of Binary Optimal Self-Orthogonal Codes by Li, Ruihu, Xu, Zongben, Zhao, Xuejun

“…The classification of binary [ n , k , d ] codes with d ges s 2 k -1 and without zero coordinates is reduced to the classification of binary [(2 k -1) c ( k ,…”
Get full text

An application of coding theory to estimating Davenport constants by Plagne, Alain, Schmid, Wolfgang A.

“…We investigate a certain well-established generalization of the Davenport constant. For j a positive integer (the case j  = 1, is the classical one) and a…”
Get full text

Optimal binary codes and binary construction of quantum codes by WANG, Weiliang, FAN, Yangyu, LI, Ruihu

“…This paper discusses optimal binary codes and pure binary quantum codes created using Steane construction. First, a local search algorithm for a special…”
Get full text

Bounds on the decoding error probability of binary linear codes via their spectra by Poltyrev, G.

“…Bounds on the error probability of maximum likelihood decoding of a binary linear code are considered. The bounds derived use the weight spectrum of the code…”
Get full text

Determination of the Local Weight Distribution of Binary Linear Block Codes by Yasunaga, K., Fujiwara, T.

“…Some methods to determine the local weight distribution of binary linear codes are presented. Two approaches are studied: A computational approach and a…”
Get full text

On the asymptotic number of non-equivalent binary linear codes by Hou, Xiang-dong

“…Denote by b ( n ) the number of non-equivalent linear codes in F 2 n and by G n , 2 the number of subspaces in F 2 n . M. Wild gave a proof that lim n → ∞ ( n…”
Get full text

The smallest length of eight-dimensional binary linear codes with prescribed minimum distance by Bouyukhev, I., Jaffe, D.B., Vavrek, V.

“…Let n(8,d) be the smallest integer n for which a binary linear code of length n, dimension 8, and minimum distance d exists. We prove that n(8,18)=42,…”
Get full text

On the weight spectrum of good linear binary codes by Ruoheng Liu, Spasojevic, P., Soljanin, E.

“…The weight spectrum of sequences of binary linear codes that achieve arbitrarily small word error probability on a class of noisy channels at a nonzero rate is…”
Get full text

An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel by Wadayama, T.

“…An efficient algorithm for calculating the ith bit error probability of a binary linear code over the binary symmetric channel (BSC) is presented. It is proved…”
Get full text