Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 240,921,288 papers from all fields of science
Search
Sign In
Create Free Account
Binary code
Known as:
Binary code (computing)
, Binary codes
, Computer binary
Expand
A binary code represents text or computer processor instructions using the binary number system's two binary digits, 0 and 1. The binary code assigns…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
A Mathematical Theory of Communication
Apple Computer, Inc. v. Franklin Computer Corp.
BCD (character encoding)
Binary file
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Deep binary prototype multi-label learning
Xiaobo Shen
,
Wei-Wei Liu
,
Yong Luo
,
Y. Ong
,
I. Tsang
International Joint Conference on Artificial…
2018
Corpus ID: 55579037
kNN embedding methods, such as the state-of-the-art LM-kNN and SLEEC, have shown impressive results in multi-label learning…
Expand
Review
2007
Review
2007
THE QUICK ALMOST OPTIMAL MULTITHRESHOLD DECODERS FOR NOISY GAUSSIAN CHANNELS
V. Zolotarev
,
R. Nazirov
,
I. Chulkov
2007
Corpus ID: 18305015
The principles of operation and performance of multithreshold decoders (MTD) are reviewed in the field of high levels of a…
Expand
2004
2004
Mining Patterns Using Relaxations of User Defined Constraints
C. Antunes
,
Arlindo L. Oliveira
2004
Corpus ID: 14341811
The main drawbacks of sequential pattern mining have been its lack of focus on user expectations and the high number of…
Expand
2002
2002
A Scalable Multi-Strategy Algorithm for Counting Frequent Sets
S. Orlando
,
P. Palmerini
,
R. Perego
,
F. Silvestri
2002
Corpus ID: 1216092
In this paper we present DCI, a new data mining algorithm for frequent set counting. We also discuss in depth the parallelization…
Expand
2000
2000
Lower Bounds for Binary Codes of Covering Radius One
W. Haas
IEEE Transactions on Information Theory
2000
Corpus ID: 36384763
Let K(n, l) denote the minimal cardinality of a binary code of length n and covering radius one. Blass and Litsyn proved a lower…
Expand
1991
1991
Orthogonality of binary codes derived from Reed-Solomon codes
C. Retter
IEEE Transactions on Information Theory
1991
Corpus ID: 26999168
The author provides a simple method for determining the orthogonality of binary codes derived from Reed-Solomon codes and other…
Expand
1985
1985
Binary codes for compound channels
P. Piret
IEEE Transactions on Information Theory
1985
Corpus ID: 32955090
The error correcting capabilities are studied of some binary codes used on channels where both independent and burst errors may…
Expand
1979
1979
Capacity Limits for Binary Codes in the Presence of Interference
D. Chase
,
L. Ozarow
IEEE Transactions on Communications
1979
Corpus ID: 62716587
Capacity limits are obtained when binary codes are used for communications over channels in the presence of high levels of…
Expand
Review
1979
Review
1979
On Constant Weight Codes and Harmonious Graphs.
Ron Graham
,
N. Sloane
1979
Corpus ID: 17951127
Abstract : Very recently a new method has been developed for finding lower bounds on the maximum number of codewords possible in…
Expand
1970
1970
On feature selection in a class of distribution-free pattern classifiers
W. Wee
IEEE Transactions on Information Theory
1970
Corpus ID: 30331035
A feature-selection procedure is proposed for the class of distribution-free pattern classifiers [1], [2]. The selection…
Expand