Search
Search Results
-
-
Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
In this paper we use the puncturing and shortening techniques on two already-known classes of optimal cyclic codes in order to obtain three new...
-
Construction of binary self-orthogonal codes
In this paper, we first give two new methods for constructing self-orthogonal codes from known self-orthogonal codes. On the basis of this, we...
-
-
Training 1-Bit Networks on a Sphere: A Geometric Approach
Weight binarization offers a promising alternative towards building highly efficient Deep Neural Networks (DNNs) that can be deployed in low-power,...
-
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
Consider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such...
-
Further projective binary linear codes derived from two-to-one functions and their duals
Binary linear codes with few weights have wide applications in communication, secret sharing schemes, authentication codes, association schemes,...
-
Coding and bounds for partially defective memory cells
This paper considers coding for so-called partially stuck (defect) memory cells. Such memory cells can only store partial information as some of...
-
On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures
A class of optimal three-weight \([q^k-1,k+1,q^{k-1}(q-1)-1]\)...
-
Additive Manufacturing
This chapter considers solving a problem in combinatorial search: the automated arrangement of irregularshaped objects for industrial 3D printing....
-
A class of subfield codes of linear codes and their duals
Recently, subfield codes of some optimal linear codes have been studied. In this paper, we further investigate a class of subfield codes and...
-
Two families of subfield codes with a few weights
Subfield codes of linear codes over finite fields have recently received a lot of attention, as some of these codes are optimal and have applications...
-
Binary linear codes with few weights from Boolean functions
Boolean functions have very nice applications in coding theory and cryptography. In coding theory, Boolean functions have been used to construct...
-
Improved bounds for codes correcting insertions and deletions
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper...
-
Performance Analysis of Maximum-Likelihood Decoding of Polar Codes
In space communication, effective channel coding schemes and decoding algorithms are essential for reliable communication. As the standard coding...
-
Identification and analysis of 3D pores in packed particulate materials
We took the classic ‘guess the number of beans in a jar game’ and amplified the research question. Rather than estimate the quantity of particles in...
-
Geometric Restrictions to the Agglomeration of Spherical Particles
Within the scope of the European Horizon 2020 project ACDC – Artificial Cells with Distributed Cores to Decipher Protein Function, we aim at the...
-
Projective binary linear codes from special Boolean functions
Linear codes with a few weights have nice applications in communication, secret sharing schemes, authentication codes, association schemes, block...