Linear codes with few weights have applications in secret sharing, authentication codes, association schemes, date storage systems, strongly regular graphs and some other fields. In this paper, we present severa
Four families of binary linear codes with three or four weights are derived and the parameters of their duals are also determined. It turns out that the duals of these codes are optimal or almost optimal with respect to the sphere-packing bound. As applications, the codes presented in this ...
Then, we construct two classes of binary linear codes with a few weights and determine their weight distributions and weight hierarchies completely. Some codes of them can be used in secret sharing schemes. Introduction For a prime number p and a positive integer s, let Fps be the finite ...
in 2015. Using this condition, it is easy to verify that such minimal linear codes satisfy wminwmax≤p−1p for any prime p, where wmin and wmax denote the minimum and maximum nonzero weights in a code, respectively. Then, by selecting the subsets of GF(p)s, we present two new ...
a specially designed penalty function, which is based on a piecewise linear function with adjustable slopes. Numerical results show that the resulting DL-aided decoders outperform the original ADMM-penalized decoder for various low density parity check (LDPC) codes with similar computational complexity....
To train a linear SVM model for binary classification on a high-dimensional data set, that is, a data set that includes many predictor variables, usefitclinearinstead. For multiclass learning with combined binary SVM models, use error-correcting output codes (ECOC). For more details, seefitcecoc...
Nonbinary Multiple-Rate LDPC Codes with Underlying QC Structure and Constant BlocklengthHuang, JieLiu, LeiZhou, WuyangZhou, Shengli
RUN.shis a bash script showing an example run of the program 64-bit codes. Set the parametersnb,HUGE,hashfunc, etc. to change the setting.RUN.shincludes suggested values form: number of hash tables. Linear scan linscanprovides an efficient implementation of exhaustive linear scan for kNN in...
We propose a new deep learning framework for it, which adopts neural networks to better learn both user and item representations and make these close to binary codes such that the quantization loss is minimized. In addition, we extend the proposed framework for out-of-sample cases, i.e., ...
Tolhuizen, A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters, Des. Codes Cryptogr. 3 (1993) 95-98.A. E. Brouwer and L. M. G. M. Tolhuizen, "A sharpening of the Johnson bound for binary linear codes and the ...