article · 2010
Design of embedded constant weight code checkers based on averaging operations
Cited by 5Abstract and details only
Abstract
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.
Cite this paper
Tarnick, S. (2010). Design of embedded constant weight code checkers based on averaging operations. https://doi.org/10.1109/iolts.2010.5560193
Tarnick, Steffen. “Design of embedded constant weight code checkers based on averaging operations.” vol. 2, 2010, pp. 255–60, https://doi.org/10.1109/iolts.2010.5560193.
Tarnick, Steffen. 2010. “Design of embedded constant weight code checkers based on averaging operations.” https://doi.org/10.1109/iolts.2010.5560193.
Tarnick, S. (2010) ‘Design of embedded constant weight code checkers based on averaging operations’. Available at: https://doi.org/10.1109/iolts.2010.5560193.
@article{tarnick2010design,
title = {{Design of embedded constant weight code checkers based on averaging operations}},
author = {Tarnick, Steffen},
volume = {2},
pages = {255--260},
year = {2010},
doi = {10.1109/iolts.2010.5560193}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Two-dimensional perfect binary arrays with 64 elements
Leopold Bömer, Markus Antweiler · IEEE Transactions on Information Theory · 1990
Cited by 29
A novel coding method for genetic algorithms based on redundant binary numbers
Akira Murayama -, Akinori Kanasugi · Artificial Life and Robotics · 2010
Cited by 3
On the capacity of non-binary write-once memory
Michal Horovitz, Eitan Yaakobi · IEEE International Symposium on Information Theory (ISIT) · 2016
Cited by 4
Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes
Behzad Amiri, Jörg Kliewer, Lara Dolecek · IEEE Transactions on Communications · 2014
Cited by 41
Binary-coded decimal to binary digital input modification of a popular digital delay module
Stephen Edward Bialkowski · Review of Scientific Instruments · 1986
Cited by 0
Two classes of binary optimum constant-weight codes
Fang‐Wei Fu, Shiyi Shen · IEEE International Symposium on Information Theory (ISIT) · 2002
Cited by 0
Bounds for Binary Multimedia Codes with the Identifiable Parent Property
Hongna Yang, Yujie Gu, Yiwei Zhang · IEEE International Symposium on Information Theory (ISIT) · 2023
Cited by 0
Spatial binary coding method for stripe-wise phase unwrapping
Yuwei Wang, Lu Liu, Jun Di Wu et al. · Applied Optics · 2020
Cited by 40