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.

Amer A. Hassan

dblp:12/1840 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
0since 2021 · last 1998
—ORCID · none

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

Computer networks · 7 · 4 first-authorTheory of computation · 2 · 2 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.

Computer networks
5 papers
Physical-layer communications · 77% Wireless networking · 12% Optical networks · 10%
Theoretical computer science
3 papers
Coding theory · 88% Information theory · 12%
Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 50%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › spread spectrum
frequency hopping
0.031996
Error rate for optimal follower tone-jamming · IEEE Trans. Commun. 1996
On a follower tone-jammer countermeasure technique · IEEE Trans. Commun. 1995
Frequency-hopped spread spectrum in the presence of a follower partial-band jammer · IEEE Trans. Commun. 1993
Physical-layer communications
spread spectrum
0.031996
Error rate for optimal follower tone-jamming · IEEE Trans. Commun. 1996
On a follower tone-jammer countermeasure technique · IEEE Trans. Commun. 1995
Frequency-hopped spread spectrum in the presence of a follower partial-band jammer · IEEE Trans. Commun. 1993
Coding theory › error-correcting codes
burst error correction
0.011998
Performance evaluation of burst-error-correcting codes on a Gilbert-Elliott channel · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes
decoding
0.021995
Decoding algorithms with input quantization and maximum error correction capability · IEEE Trans. Inf. Theory 1995
On decoding concatenated codes · IEEE Trans. Inf. Theory 1990
Coding theory › error-correcting codes › error detection and correction
error and erasure correction
0.021995
Decoding algorithms with input quantization and maximum error correction capability · IEEE Trans. Inf. Theory 1995
On decoding concatenated codes · IEEE Trans. Inf. Theory 1990
Physical-layer communications › spread spectrum
jamming countermeasures
0.011995
On a follower tone-jammer countermeasure technique · IEEE Trans. Commun. 1995
Optical networks
optical code-division multiple access
0.011995
Spatial Optical CDMA · IEEE J. Sel. Areas Commun. 1995
Cryptographic protocols and secure computation
key management
0.011995
Unconventional cryptographic keying variable management · IEEE Trans. Commun. 1995
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption
0.011995
Unconventional cryptographic keying variable management · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011995
Decoding algorithms with input quantization and maximum error correction capability · IEEE Trans. Inf. Theory 1995
Wireless networking
anti-jamming
0.031996
Error rate for optimal follower tone-jamming · IEEE Trans. Commun. 1996
On a follower tone-jammer countermeasure technique · IEEE Trans. Commun. 1995
Frequency-hopped spread spectrum in the presence of a follower partial-band jammer · IEEE Trans. Commun. 1993
Coding theory › error-correcting codes
concatenated codes
0.011990
On decoding concatenated codes · IEEE Trans. Inf. Theory 1990
Coding theory › error-correcting codes › decoding › iterative decoding
parallel decoding
0.011990
On decoding concatenated codes · IEEE Trans. Inf. Theory 1990
Information theory › communication channels
channel models
0.011998
Performance evaluation of burst-error-correcting codes on a Gilbert-Elliott channel · IEEE Trans. Commun. 1998
Information theory › channel capacity › state-dependent channel › finite-state channel
gilbert-elliott channel
0.011998
Performance evaluation of burst-error-correcting codes on a Gilbert-Elliott channel · IEEE Trans. Commun. 1998
Physical-layer communications › receiver design › optimum receiver
correlation receiver
0.011995
Spatial Optical CDMA · IEEE J. Sel. Areas Commun. 1995
Physical-layer communications
multiple access
0.011995
Spatial Optical CDMA · IEEE J. Sel. Areas Commun. 1995

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

ultrawide bandwidth modem · 0.0mutual sounding · 0.0recursive probability analysis · 0.0performance analysis · 0.0synchronization schemes · 0.0randomized decision strategy · 0.0random coding · 0.0game-theoretic randomized strategy · 0.0
YearPublicationVenuePosition
1998 Performance evaluation of burst-error-correcting codes on a Gilbert-Elliott channel
abstract
The performance of single burst-error-correcting (BEC) codes used over bursty channels is evaluated. The channel is represented by the Gilbert-Elliott (1960, 1963) model, which has been used by numerous authors to evaluate the performance of random-error-correcting (REC) codes over bursty channels. Recursive expressions are derived, which are used in evaluating the probability of a codeword error. These expressions and an approximate closed-form expression are applied to the performance of a single (23,12) BEC code.
Gaurav Sharma 0001, Amer A. Hassan, Ajay Dholakia
IEEE Trans. Commun.2
1997 Markov Oscillators and Direct Sequence Spread Spectrum
abstract
This paper presents a concept under development, that of dynamically coloring the spectrum of a pseudorandom spreading code in order to aid slow rate data communication in a very poor channel. The method seems to hold promise for some difficult industrial communications problems, especially for wireless random access communications in time varying noisy channels that are difficult to effectively model and are resistant to conventional approaches.
John E. Hershey, Amer A. Hassan
ICC (3)2
1996 Error rate for optimal follower tone-jamming
abstract
The performance of a countermeasure technique in the presence of the optimal follower multitone jammer is evaluated for frequency-hopped spread spectrum (FHSS) communications. It is shown that, with a certain probability, the optimal jammer will have dual tones in a frequency channel.
Amer A. Hassan, Wayne E. Stark, John E. Hershey
IEEE Trans. Commun.1
1995 Spatial Optical CDMA
abstract
A method for optical signaling is investigated that allows multiple transmitters to simultaneously use the same noncoherent receiving aperture. The signaling is based on the properties of laser speckle interference patterns. Capacity for an interference limited system is explored for a correlation receiver based on random coding. A synchronization scheme is presented that allows a practical implementation of the proposed optical multiple access system.>
Amer A. Hassan, John E. Hershey, Nabeel A. Riza
IEEE J. Sel. Areas Commun.1
1995 On a follower tone-jammer countermeasure technique
abstract
A countermeasure technique to a follower tone-jammer is evaluated for frequency-hopped spread spectrum communications. This technique utilizes randomized decisions by the transmitter and the receiver to lure the jammer into helping the communicator's performance part of the time. It is shown that the proposed technique reduces the bit error rate of the system.>
Amer A. Hassan, John E. Hershey, Jim Schroeder 0001
IEEE Trans. Commun.1
1995 Unconventional cryptographic keying variable management
abstract
We present three unconventional approaches to keying variable management. The first approach is based on using a public key cryptosystem (PKC) that is breakable in short, but on average less, time than it takes to set up an ultrawide bandwidth modem that is then used to transport a keying variable for a classical cryptosystem. The second concept proposes using the characteristics of an urban UHF radio channel, determined by mutual sounding, as the cryptovariable. The third concept encourages research into ill-conditioned problems as potentially fruitful ground for PKCs not based on finite field arithmetic.>
John E. Hershey, Amer A. Hassan, Rao K. Yarlagadda
IEEE Trans. Commun.2
1995 Decoding algorithms with input quantization and maximum error correction capability
abstract
Decoding that uses soft-decision information but with multiple low-complexity decoders are investigated. These decoders correct only errors and erasures. The structure of the receiver consists of a bank of z demodulators followed by errors- and erasures-correcting decoders operating in parallel. Each demodulator has a threshold for determining when to erase a given symbol. We assign a cost f(/spl theta/) to the noise for causing an erasure when the receiver uses a particular threshold /spl theta/ and a (larger) cost f(/spl theta.>
Amer A. Hassan, Wayne E. Stark
IEEE Trans. Inf. Theory1
1994 Down-link capacity of a frequency hopped TDMA cellular system
abstract
We evaluate the down-link (base-to-mobile) capacity of a frequency-hopped TDMA system using a theoretical development of outage probability. Expressions for outage probability are provided considering voice activity, antenna diversity and Reed-Solomon coding. The system capacity is evaluated with and without power control. Down-link capacity is compared with up-link capacity. The effect of increasing system bandwidth on capacity is analyzed. Finally, the issue of calculating capacity under the assumption of connecting mobiles to the closest base station instead of the strongest base station is examined.>
Sandeep Chennakeshu, Amer A. Hassan, John B. Anderson
VTC2
1993 Frequency-hopped spread spectrum in the presence of a follower partial-band jammer
abstract
A countermeasure to a partial-band follower jammer is proposed for frequency-hopped spread-spectrum communications. This technique randomizes the transmission technique used by the transmitter (and receiver). Either the information is carried by M tones which are transmitted in a frequency slot, or by M frequency slots which contain signal energy. As a counter-countermeasures, the jammer randomizes between jamming the same frequency slot being used by the communicator, or jamming a subset of the slots not being used by the communicator. The performance for randomized strategies for the communicator and jammer is investigated. It is shown that the proposed technique enhances the system's performance.>
Amer A. Hassan, Wayne E. Stark, John E. Hershey
IEEE Trans. Commun.1
1990 On decoding concatenated codes
abstract
The correcting properties of concatenated codes with parallel decoding over an additive channel are investigated. The ith inner decoder's output is a codeword if the Euclidean distance between the received vector and some codeword is less than Delta /sub i/ and an erasure otherwise. The outer decoders correct errors and erasures. The error-correcting capability, which is taken to be the minimum length of any noise vector that can cause an error, is obtained for a bank of z inner and outer decoders as a function of the thresholds used. The set of thresholds that maximize the error-correcting capability is also found. It is shown that for a small number of branches, the error-correcting capability is nearly as large as any decoder.>
Amer A. Hassan, Wayne E. Stark
IEEE Trans. Inf. Theory1