Alphabet

Known as: Input symbol 
In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the alphabet of a string… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
020040060019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We study the design optimization of linear precoders for maximizing the mutual information between finite alphabet input and the… (More)
  • table I
  • table II
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Two Bayesian methods, BayesCπ and BayesDπ, were developed for genomic prediction to address the drawback of BayesA and BayesB… (More)
  • table 1
  • table 2
Is this relevant?
2008
2008
We investigate automated and generic alphabet reduction techniques for protein structure prediction datasets. Reducing alphabet… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We address the problem of multiclass object detection. Our aims are to enable models for new categories to benefit from the… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider a generalization of the problem of supporting rank and select queries on binary strings. Given a string of length <i… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
It has long been known that the compression redundancy of independent and identically distributed (i.i.d.) strings increases to… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Novel blind channel estimators based on the finite alphabet property of information symbols are derived in this paper for OFDM… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The suux tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner Wei73], who introduced the… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This pap er present s a theory of convergence for realcoded genet ic algorit hmsGAs that use float ing-point or oth er… (More)
Is this relevant?