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.

FaLiang Ao

dblp:68/9845 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 1

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.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › MIMO
MIMO and space-time coding
0.112011
Super-orthogonal space-time code design based on the trellis diagram integrated operation · Sci. China Inf. Sci. 2011
Physical-layer communications › MIMO › space-time coding
space-time code design
0.112011
Super-orthogonal space-time code design based on the trellis diagram integrated operation · Sci. China Inf. Sci. 2011
Coding theory
error-correcting codes
0.012011
Super-orthogonal space-time code design based on the trellis diagram integrated operation · Sci. China Inf. Sci. 2011
Coding theory
trellis codes
0.012011
Super-orthogonal space-time code design based on the trellis diagram integrated operation · Sci. China Inf. Sci. 2011

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

trellis diagram design · 0.2
YearPublicationVenuePosition
2011 Super-orthogonal space-time code design based on the trellis diagram integrated operation
Jun Ao, Chunbo Ma, FaLiang Ao, Guisheng Liao
Sci. China Inf. Sci.3
2005 Certificateless group inside signature
abstract
In distributed networks, the signer wants his signature to be verified by anyone in the same group with him and the recipient wants to verify the signature independently. Motivated by this consideration, a certificateless group inside signature is presented in this paper. The signature scheme has the following properties: despite being without certificate, it can provide an assurance to the user about the relationship between a public key and the identity of the holder of the corresponding private key; a signature can be verified independently by any member in the same group with the signer; nobody outside the group can verify a signature. It is only the signer who knows his private key, even the PKG (private key generator) doesn't; any one in or outside the group can't forge a signature of others.
Chunbo Ma, FaLiang Ao, Dake He
ISADS2