Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuan Cao 0001

dblp:52/4472-1 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0002-3089-0046ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-authorSecurity and privacy · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes
linear code
0.722020
Self-Dual Binary $[8m, \, \, 4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$ · IEEE Trans. Inf. Theory 2020
On a Class of Left Metacyclic Codes · IEEE Trans. Inf. Theory 2016
Coding theory › error-correcting codes › block codes › group codes
dihedral code
0.412020
Self-Dual Binary $[8m, \, \, 4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$ · IEEE Trans. Inf. Theory 2020
Coding theory › error-correcting codes › optimal codes
extremal codes
0.412020
Self-Dual Binary $[8m, \, \, 4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$ · IEEE Trans. Inf. Theory 2020
Coding theory › error-correcting codes › block codes › linear code
self-dual codes
0.412020
Self-Dual Binary $[8m, \, \, 4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$ · IEEE Trans. Inf. Theory 2020
Coding theory › error-correcting codes
concatenated codes
0.212016
On a Class of Left Metacyclic Codes · IEEE Trans. Inf. Theory 2016
Coding theory › error-correcting codes › block codes › linear code
dual code
0.212016
On a Class of Left Metacyclic Codes · IEEE Trans. Inf. Theory 2016

Methods — techniques the papers use, named apart from their topics

finite chain ring theory · 0.4congruence equation solving · 0.4skew cyclic code theory · 0.2finite field theory · 0.2cyclic code theory · 0.2
YearPublicationVenuePosition
2020 Self-Dual Binary $[8m, \, \, 4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$
abstract
Let m be an arbitrary positive integer and D8mbe the dihedral group of order 8m, i.e., D8m= (x, y | x4m= 1, y2= 1, yxy = x-1). Left ideals of the dihedral group algebra F2[D8m] are called binary left dihedral codes of length 8m, and abbreviated as binary left D8m-codes. In this paper, we give an explicit representation and enumeration for all distinct self-dual binary left D8m-codes. These codes make up an important class of self-dual binary [8m, 4m]-codes such that the dihedral group D8mis necessarily a subgroup of the automorphism group of each code. In particular, we provide recursive algorithms to solve congruence equations over finite chain rings for constructing all distinct self-dual binary left D8m-codes and obtain a Mass formula to count the number of all these self-dual codes. As a preliminary application, we obtain the extremal self-dual binary [48, 24, 12]-code and an extremal self-dual binary [56, 28, 12]code from self-dual binary left D48-codes and left D56-codes respectively.
Yuan Cao 0001, Yonglin Cao, Fang-Wei Fu 0001, Jian Gao 0001
IEEE Trans. Inf. Theory1
2019 Construction and enumeration for self-dual cyclic codes over Z4 of oddly even length
Yuan Cao 0001, Yonglin Cao, Steven T. Dougherty, San Ling
Des. Codes Cryptogr.1
2016 On a Class of Left Metacyclic Codes
abstract
Let G(m,3,r)= (x, y | xm= 1, y3= 1, yx = xry) be a metacyclic group of order 3m, where gcd(m, r) = 1, 13≡ 1 (mod m). Then, left ideals of the group algebra Fq[G(m,3,r)] are called left metacyclic codes over Fq of length 3m, and abbreviated as left G(m,3,r)-codes. A system theory for left G(m,3,r)-codes is developed for the case of gcd(m, q) = 1 and r ≡ qE(mod m) for some positive integer ε, only using finite field theory and basic theory of cyclic codes and skew cyclic codes. The fact that any left G(m,3 1)-code is a direct sum of concatenated codes with inner codes λiand outer codes Ciis proved, where . Aiis a minimal cyclic code over Fqof length m and Ciis a skew cyclic code of length 3 over an extension field of Fq. Then, an explicit expression for each outer code in any concatenated code is provided. Moreover, the dual code of each left G(m,3,r)-code is given and self-orthogonal left G(m,3,r)-codes are determined.
Yonglin Cao, Yuan Cao 0001, Fang-Wei Fu 0001, Jian Gao 0001
IEEE Trans. Inf. Theory2
2011 Multi-focus Image Fusion by Nonsubsampled Shearlet Transform
abstract
In this paper we introduce the nonsubsampled shear let transform for multi-focus image fusion. In the proposed method, source images are decomposed by nonsubsampled shear let transform firstly. Then the decomposition coefficients are merged according to the given fusion rule. Finally the fused image is reconstructed by inverse nonsubsampled shear let transform. The experimental results over five pairs of registered multi-focus images and one pair of mis-registered multi-focus images demonstrate the superiority of the proposed method.
Yuan Cao 0001, Shutao Li 0001, Jianwen Hu
ICIG1