Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,381,613 papers from all fields of science
Search
Sign In
Create Free Account
Constant-weight code
Known as:
M-of-n code
, M of n code
, Balanced code
Expand
In coding theory, a constant-weight code, also called an m of n code, is an error detection and correction code where all codewords share the same…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Address decoder
Asynchronous circuit
Barcode
Berger code
Expand
Broader (2)
Error detection and correction
Information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Метод оценки границ применения сжатия на основе двоичных биномиальных чисел
Игорь Анатольевич Кулик
,
Анатолий Иванович Новгородцев
,
Мария Сергеевна Шевченко
Системи обробки інформації
2016
Corpus ID: 125923304
2015
2015
Deterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes
Liqing Xu
,
Hao Chen
arXiv.org
2015
Corpus ID: 3249602
The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in…
Expand
2015
2015
Design and implementation of low power channel code for long distance data transmission
Cheng Ma
,
S. Zhou
,
Jian-ping Xiong
2015
Corpus ID: 110644655
Data transmission channel is the most power consumption part in large scale seismic data acquisition system. In this paper, 9B…
Expand
2013
2013
Prefixless q-ary Balanced Codes
Kees A. Schouhamer Immink
2013
Corpus ID: 18282076
We will present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries…
Expand
2011
2011
Improved Linear Programming Bounds on Sizes of Constant-Weight Codes
B. Kang
,
H. Kim
,
Phan Thanh Toan
arXiv.org
2011
Corpus ID: 9219210
Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte…
Expand
2010
2010
M-of-N Code Decomposition for Indicating Combinational Logic
W. Toms
,
D. A. Edwards
IEEE Symposium on Asynchronous Circuits and…
2010
Corpus ID: 12233685
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing self-timed…
Expand
Review
2005
Review
2005
Identification via Channels and Constant-Weight Codes
K. Eswaran
2005
Corpus ID: 13278690
In the standard problem of transmission, the goal is to encode a message in a way such that after it passes through a noisy…
Expand
2003
2003
Two-dimensional wavelength/time optical CDMA system adopting balanced-modified pseudo random noise matrix codes
김병휘
,
김봉규
,
박상조
,
연영희
,
조성찬
2003
Corpus ID: 196194983
Balanced-strain similar noise (Balanced modified PN) matrix code is applied to a two-dimensional wavelength / time domain optical…
Expand
1995
1995
Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors
H. Alnuweiri
IEEE Trans. Parallel Distributed Syst.
1995
Corpus ID: 6871898
This short note presents constant-time algorithms for labeling the connected components of an image on a network of processors…
Expand
1980
1980
7B8B balanced code with simple error detecting capability
R. Brooks
1980
Corpus ID: 62661005
A description is given of a simple in-service error detection technique suitable for use at dependent repeaters. The technique is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE