Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 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.
2017
2017
Z2Z4Z8-Cyclic Codes
Ismail Aydogdu
,
F. Gursoy
arXiv.org
2017
Corpus ID: 3109553
In this paper we study Z2Z4Z8-additive codes, which are the extension of recently introduced Z2Z4-additive codes. We determine…
Expand
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
Neutrosophic Code
Mumtaz Ali
,
F. Smarandache
,
Munazza Naz
,
M. Shabir
2015
Corpus ID: 30169818
The idea of neutrosophic code came into my mind at that time when i was reading the literature about linear codes and i saw that…
Expand
2013
2013
New extremal binary self-dual codes of length 68 from R2-lifts of binary self-dual codes
Suat Karadeniz
,
B. Yildiz
Advances in Mathematics of Communications
2013
Corpus ID: 32538014
A lift of binary self-dual codes to the ring $R_2$ is described. By using this lift, a family of self-dual codes over $R_2$ of…
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
2010
2010
Unimodular Lattices and Self-dual Codes
H. Koch
,
H. Koch
2010
Corpus ID: 117037112
for x = (ici,..., xn) and y = (y\,..., yn) in K . The elements of Fg, considered as functions on {1, . . . ,n}, will be…
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
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
1981
1981
A binary extremal doubly even self-dual code (64, 32, 12) obtained from an extended Reed-Solomon code over Fl6
G. Pasquier
IEEE Transactions on Information Theory
1981
Corpus ID: 36856225
The binary image of an extended Reed-Solomon code over F_{16} relative to a trace-orthogonal basis of F_{l6} is an extremal…
Expand
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