Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,400,288 papers from all fields of science
Search
Sign In
Create Free Account
Dual code
Known as:
Self-dual code
In coding theory, the dual code of a linear code is the linear code defined by where is a scalar product. In linear algebra terms, the dual code is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
CSS code
Coding theory
Enumerator polynomial
Even code
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Another Generalization of the Reed-Muller Codes
C. Ding
,
Chunlei Li
,
Yongbo Xia
arXiv.org
2016
Corpus ID: 2429599
The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized Reed-Muller code over $\gf(q…
Expand
2015
2015
Efficient Two-Write WOM-Codes for Non-Volatile Memories
M. Chua
,
K. Cai
,
W. Goh
IEEE Communications Letters
2015
Corpus ID: 34320611
A write once memory (WOM) is defined as a class of storage medium, with each storage element known as a cell, that contains…
Expand
Review
2012
Review
2012
Secret Sharing Schemes and Linear Codes
Hakan Özadam
,
F. Özbudak
,
Zülfükar Saygı
2012
Corpus ID: 16905820
The study of secret sharing schemes was independently initiated by Shamir and Blakely in 1979. Since then several other secret…
Expand
2008
2008
Construction of Self-Dual Codes
H. Tsai
,
Pei-Yu Shih
,
Ren-Yih Wu
,
Wen-Ku Su
,
Chien-Hung Chen
IEEE Transactions on Information Theory
2008
Corpus ID: 18866228
Construction methods for self-dual codes are given. By using these methods some new extremal self-dual [66, 33, 12] and [68, 34…
Expand
2008
2008
A cutting plane method based on redundant rows for improving fractional distance
M. Miwa
,
T. Wadayama
,
I. Takumi
5th International Symposium on Turbo Codes and…
2008
Corpus ID: 17151020
In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check…
Expand
2005
2005
On the EXIT chart analysis of low-density parity-check codes
Sreenivas Rao Kollu
,
H. Jafarkhani
GLOBECOM '05. IEEE Global Telecommunications…
2005
Corpus ID: 35972721
The extrinsic information transfer (EXIT) charts are used to analyze the sum-product decoding algorithm of low-density parity…
Expand
2003
2003
A systematic construction of self-dual codes
J. Carlach
,
A. Otmani
IEEE Transactions on Information Theory
2003
Corpus ID: 43669325
A new coding construction scheme of block codes using short base codes and permutations that enables the construction of binary…
Expand
1996
1996
The ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice
A. Calderbank
,
N. Sloane
IEEE Transactions on Information Theory
1996
Corpus ID: 2562455
The 12-dimensional Coxeter-Todd lattice can be obtained by lifting the ternary Golay code to a code over the integers mod 9 and…
Expand
1992
1992
Existence of some extremal self-dual codes
H. Tsai
IEEE Transactions on Information Theory
1992
Corpus ID: 632805
Two new singly-even extremal, self-dual codes are constructed: a (52,26,10) code and a (54,27,10) code. >
1972
1972
Some results on the minimum distance structure of cyclic codes
C. Hartmann
,
K. Tzeng
,
R. Chien
IEEE Transactions on Information Theory
1972
Corpus ID: 33301400
This paper presents a number of interesting results relating to the determination of actual minimum distance of cyclic codes…
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
or Only Accept Required