Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 1,034 papers for “Constant-weight code”
Erik Agrell, Alexander Vardy, K. Zeger · Chalmers Research (Chalmers University of Technology) · 2002
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for spherical codes. In particular, we improve upon the 1982 Johnson bound and the linear programming bound for constant-weight codes.
Cited by 1Open access
Moshe Milshtein · Cryptography and Communications · 2022
Cited by 0
Moshe Milshtein · Cryptography and Communications · 2023
Cited by 0Open access
Gutenko, Denys · Technical Transactions · 2018
Cited by 0Open access
Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen · Advances in Mathematics of Communications · 2016
Ternary constant weight codes of length $n=2^m$, weight $n-1$,cardinality $2^n$ and distance $5$ are known to existfor every $m$ for which there exists an APN permutation of order $2^m$,that is, at least for all odd $m \geq 3$ and for $m=6$.We show the non-existence of such codes for $m=4$and prove that any codes with the parameters above arediameter perfect.
Cited by 2Open access
Yasui, Tatsuya, Tanaka, Takuro, Malik, Asad et al. · Okayama University Scientific Achievement Repository (Okayama University) · 2022
Deep Neural Network (DNN) watermarking techniques are increasingly being used to protect the intellectual property of DNN models. Basically, DNN watermarking is a technique to insert side information into the DNN model without significantly degrading the performance of its original task. A pruning attack is a threat to DNN watermarking, wherein the less important neurons in the model are pruned to make it faster and more compact. As a result, removing the watermark from the DNN model is possible. This study investigates a channel coding approach to protect DNN watermarking against pruning attacks. The channel model differs completely from conventional models involving digital images. Determining the suitable encoding methods for DNN watermarking remains an open problem. Herein, we presented a novel encoding approach using constant weight codes to protect the DNN watermarking against pruning attacks. The experimental results confirmed that the robustness against pruning attacks could be controlled by carefully setting two thresholds for binary symbols in the codeword.
Cited by 0
Steffen Tarnick · 2010
This paper presents a novel method of designing embedded checkers for constant weight codes. The design method is based on an operation that maps a binary vector to a vector of half length and half weight. Applied to words of constant weight codes this operation preserves essential properties of these words. The checkers designed with this method have a much smaller size than previously proposed embedded checkers for constant weight codes and sometimes they are even smaller than some of the non-embedded checkers that are designed using a particular method from the literature.
Cited by 5
TALLINI, LUCA · Virtual Community of Pathological Anatomy (University of Castilla La Mancha) · 2000
Cited by 0
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu · 2008
The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the resource (e.g., capacity) of the wireless mesh network is limited. Worst yet, the wireless link quality is time and space varying, depending on the environment and interference. In order to make efficient use of the scarce channel resource during topology formation, scheduling and routing, it is vital to understand the quality of the links in the wireless mesh network (in terms of, e.g.,probability of successful transmission, or signal to noise ratio). The existing approaches for link assessment consume substantial amount of time and thus introduce significant delay and overhead. In this paper, we propose a novel link assessment scheme where the link assessment packets are transmitted efficiently according to a set of non-constant weight codes, which achieves low collision probability within a short link assessment period. In our proposed approach, each node considers the actual nodal degree while choosing the codeword for its link assessment. In this work, we design the link assessment procedure and establish a set of theorems that provide the necessary condition for successful link assessment. Extensive simulations are carried out, showing that our proposed approach reduces link assessment delay by over 70% compared to the orthogonal optical code OOC-based approach.
Cited by 0
Д.В. Ефанов, Vladimir Sapozhnikov, Вл. В. Сапожников et al. · Proceedings of the Institute for System Programming of RAS · 2019
A new method of combinational circuits concurrent checking is considered based on Boolean complement of the working functions of the diagnosis object to the constant-weight code words with parallel checkout of the bits functions belonging to the self-dual functions class of the Boolean logic. The described approach to the organization of concurrent error-detection (CED) systems allows to increase the detection ability in comparison with the traditional checkout by constant-weight code. In this case, the undetectable error can be a such error, which will lead to the preservation of the code word weight generated at the outputs of the Boolean complement block, if the distortions of all the functions bits on the opposite sets is coincide. This condition is more stringent than the checkout of the vector belonging a pre-selected code, it means that it gives a greater probability of detecting distortion arising from errors. The described method allows checkout of combinational circuit based on constant-weight codes with the same number of single and zero bits. In this case, the priority is in the widely used «2-out-of-4» code, which has a simple checker structure. A detailed description of the new CED system structure is given, and algorithms for the extension of definition of the values of the checkout functions that provide testability of technical diagnostic tools are given.
Cited by 2Open access
Manjusri Basu, Bandhu Prasad · Discrete Mathematics Algorithms and Applications · 2010
Let [Formula: see text] denote the average Hamming distance of a binary constant weight code C. A i is the distance distribution of C and B j is the transform quantity of A i . Let β(n, M, w) denote the minimum average Hamming distance of a binary constant weight code with length n, size M, and weight w. In this paper, we have established the relation among B j , [Formula: see text] and A i . We also study the problem of determining β(n, M, w) and bounds of β(n, M, w) for different values of M.
Cited by 1
Valiant, W.G. · CWI's Institutional Repository (Centrum Wiskunde & Informatica) · 1976
Cited by 0Open access
Yuxuan Zhou, Youfu Li · 2024
The long-term memory (LTM) is generally considered as the unlimited and permanent storage of information in the human brain. This concept has spurred numerous researches focusing on associative memory models, such as Sparse Distributed Memory (SDM) in the past, as well as the increasing interest in brain-inspired Spiking Neural Networks (SNN). In this paper, we present an SDM-like SNN, which combines elements of both SDM and SNN for unsupervised training and inference processing. Despite the hardware-friendly nature of event-driven processing, SNN still faces criticism due to its large memory footprint and repetitive neuron operations. Therefore, the objective of this study is to demonstrate the complementary nature of SDM and SNN, with the aim of significantly reducing energy consumption while maintaining an acceptable level of accuracy loss on neuromorphic computing systems. As an integral part of the SDM-like design, we have developed and thoroughly tested an M-of-N code generation method. The experimental results on the MNIST dataset demonstrated that the proposed constant-weight Fibonacci code SDM-SNN achieves 87.4% accuracy with a simplified 2-bit unsupervised learning rule. In addition, with only 400 neurons, the proposed SDM-SNN hardware architecture reduces numerous energy consumption to 4.5-nJ/classification and 7.5 pJ/SOP with just a little performance degradation <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(\sim 3.7\%)$</tex> compared to the SOTA full-connected SNN network.
Cited by 0
Trần Thị Thao, Huong Thi Thu Tran, Vu Van Khu · 2024
The local rank modulation scheme, a generalization of the rank modulation scheme, is proposed for accurate and effective data representation in flash memory. In this scheme, a sliding window traversing a sequence of real-valued variables yields a sequence of permutations. We focus on constant-weight Gray codes for the scheme. We represent two constructions for Gray codes of weights 2 and 3 proposed in [6] by grouping transition rules to create more easily calculable paths. From that we give calculations for the ranking and un-ranking on these Gray codes. Additionally, we show that the calculations are efficient by showing their running time in constant and logarithmic time for Gray codes of weights 2 and 3 respectively.
Cited by 0
Masahiro Ueno, Masahiro Endo, Yoshiaki Kurokawa et al. · Japanese Journal of Applied Physics · 2008
For a two-dimensional constant-weight block code, we show that the recording density is proportional to code rate and the second power of the size of the bright point. Second, we show four constant-weight block codes (two 2:16 codes, a 4:24 code, and a 4:16 code) with different code rates. In simulation experiments, we measured the maximum size of bright points for each code, the bit error rate was practical (10-4 or less), and simulation results show that the maximum size increases as the code rate decreases. Then, we show that the highest recording density is achieved with the two 2:16 codes and the 4:24 code and that these codes are suitable for orthogonal aperture-multiplexing. We also show that there is a trade-off between multiplexity and the code rate.
Cited by 0
Minoru Kuribayashi, Tatsuya Yasui, Asad Malik · Preprints.org · 2023
Deep neural network (DNN) watermarking is a potential approach for protecting the intellectual property rights of DNN models. Similar to classical watermarking techniques for multimedia content, the requirements for DNN watermarking include capacity, robustness, and transparency, and other factors. Studies have focused on robustness against retraining and fine-tuning. However, less important neurons in the DNN model may be pruned. Moreover, although the encoding approach in renders DNN watermarking robust against pruning attacks, the watermark is assumed to be embedded only into the fully connected layer in the fine-tuning model. In this study, we extended the method such that the model can be applied to any convolution layer of the DNN model and designed a watermark detector based on a statistical analysis of the extracted weight parameters to evaluate whether the model is watermarked. Using a nonfungible token mitigates the overwriting of the watermark and enables checking when the DNN model with the watermark was created.
Cited by 2Open access
Minoru Kuribayashi, Tatsuya Yasui, Asad Malik · Journal of Imaging · 2023
Deep neural network (DNN) watermarking is a potential approach for protecting the intellectual property rights of DNN models. Similar to classical watermarking techniques for multimedia content, the requirements for DNN watermarking include capacity, robustness, transparency, and other factors. Studies have focused on robustness against retraining and fine-tuning. However, less important neurons in the DNN model may be pruned. Moreover, although the encoding approach renders DNN watermarking robust against pruning attacks, the watermark is assumed to be embedded only into the fully connected layer in the fine-tuning model. In this study, we extended the method such that the model can be applied to any convolution layer of the DNN model and designed a watermark detector based on a statistical analysis of the extracted weight parameters to evaluate whether the model is watermarked. Using a nonfungible token mitigates the overwriting of the watermark and enables checking when the DNN model with the watermark was created.
Cited by 3Open access
Д.В. Ефанов · Proceedings of Petersburg Transport University · 2016
Cited by 0
Yang Xu, Haibin Kan, Guangyue Han · ArXiv.org · 2025
In this paper, we characterize the MacWilliams extension property (MEP) and constant weight codes with respect to $ω$-weight defined on $\mathbb{F}^Ω$ via an elementary approach, where $\mathbb{F}$ is a finite field, $Ω$ is a finite set, and $ω:Ω\longrightarrow\mathbb{R}^{+}$ is a weight function. Our approach relies solely on elementary linear algebra and two key identities for $ω$-weight of subspaces derived from a double-counting argument. When $ω$ is the constant $1$ map, our results recover two well-known results for Hamming metric code: (1) any Hamming weight preserving map between linear codes extends to a Hamming weight isometry of the entire ambient space; and (2) any constant weight Hamming metric code is a repetition of the dual of Hamming code.
Cited by 0Open access
Tallini, Luca G., Bose, Bella · UniTERAMO Research Catalog (University of Teramo) · 2019
This talk gives some theory and efficient design of binary block codes capable of correcting the deletions of the symbol "0" (referred to as 0-deletions) and/or the insertions of the symbol "0" (referred to as 0-insertions). This problem of correcting 0-deletions and/or 0-insertions (referred to as 0-errors) is shown to be equivalent to the efficient design of some L1 metric asymmetric error control codes over the natural alphabet, N. In particular, it is shown that t 0-insertion correcting codes are actually capable of controlling much more; namely, they can correct at most t 0-errors, detect at most (t+1) 0-errors and, simultaneously, detect all occurrance of only 0-deletions or only 0-insertions in every received word (briefly, they are t-Sy0EC/(t+1)-Sy0ED/AU0ED codes). From the relations with the L1 distance error control codes, new improved bounds are given for the optimal t 0-errors correcting codes. Optimal non-systematic and systematic code designs are given. In particular, for t in N, a recursive method is presented to define a family of systematic t-Sy0EC/(t+1)-Sy0ED/AU0ED codes with k in N information bits and length n=k+r in N where the redundancy is r=t*log_{2}k+o(t*log n), as max{t,k} increases. Decoding can be efficiently performed by algebraic means with the Extended Euclidean Algorithm (EEA).
Cited by 0