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.

Keiichiro Koga

dblp:29/11126 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Computer networks · 3 · 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
1 paper
Coding theory · 100%
Computer graphics and multimedia
2 papers
Audio and music processing · 100%
Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 62% Digital forensics and information hiding · 38%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.011998
A simple decoding of BCH codes over GF(2m) · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › cyclic codes › BCH codes
BCH decoding
0.011998
A simple decoding of BCH codes over GF(2m) · IEEE Trans. Commun. 1998
Coding theory
error-correcting codes
0.011998
A simple decoding of BCH codes over GF(2m) · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › decoding › linear code decoding
syndrome decoding
0.011998
A simple decoding of BCH codes over GF(2m) · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › decoding › algebraic decoding
error-locator polynomial
0.011998
A simple decoding of BCH codes over GF(2m) · IEEE Trans. Commun. 1998
Audio and music processing › audio security
speech scrambling
0.011989
An analog speech scrambling system using the FFT technique with high-level security · IEEE J. Sel. Areas Commun. 1989
Digital forensics and information hiding
information hiding
0.011984
A Speech Scrambler Using the Fast Fourier Transform Technique · IEEE J. Sel. Areas Commun. 1984
Cryptographic primitives and cryptanalysis › encryption › multimedia encryption
speech scrambling
0.011984
A Speech Scrambler Using the Fast Fourier Transform Technique · IEEE J. Sel. Areas Commun. 1984
Audio and music processing
echo cancellation
0.011989
An analog speech scrambling system using the FFT technique with high-level security · IEEE J. Sel. Areas Commun. 1989
Audio and music processing
speech processing
0.011984
A Speech Scrambler Using the Fast Fourier Transform Technique · IEEE J. Sel. Areas Commun. 1984

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

berlekamp-massey algorithm · 0.0fast fourier transform · 0.0
YearPublicationVenuePosition
1998 A simple decoding of BCH codes over GF(2m)
abstract
A simple decoding method for even minimum-distance Bose-Chaudhuri-Hochquenghem (BCH) codes is proposed. In the method the coefficients of an error locator polynomial are given as simple determinants (named Q determinants) composed of syndromes. The error evaluator is realized as a Q determinant divided by an error locator polynomial. The Q determinants can be efficiently obtained with very simple calculations on syndromes enabling the realization of a high-speed decoder of simple configuration. The number of calculations in obtaining the error locator and the error evaluator with the proposed method is smaller than that with the widely used Berlekamp-Massey algorithm when the number of correctable errors of the code is five or less. The proposed method can also be applied to the binary narrow-sense BCH codes of odd minimum distance.
Keiichiro Koga
IEEE Trans. Commun.1
1989 An analog speech scrambling system using the FFT technique with high-level security
abstract
A full-duplex analog speech-scrambling system is proposed for application to mobile communication systems and public switched telephone networks. The scrambling algorithm is based on the rearrangement of the fast Fourier transform (FFT) coefficients accompanied by adaptive dummy spectrum insertion and companding operation. The simulation results indicate that the scrambled speech has no residual intelligibility and the descrambled speech quality is satisfactory. The hardware unit is implemented by using seven advanced digital signal processor chips, including those for an adaptive equalizer and an echo canceller for full-duplex operation. The performance is proven to be satisfactory.>
Akira Matsunaga, Keiichiro Koga, Michihisa Ohkawa
IEEE J. Sel. Areas Commun.2
1984 A Speech Scrambler Using the Fast Fourier Transform Technique
abstract
This paper describes an analog speech scrambler using the FFT technique (FFT scrambler). The FFT scrambler provides highly secured scrambled signal by permuting a large number of FFT coefficients. Important items to be considered in the designing of the FFT scrambler are discussed, such as FFT frame length, permutation of FFT coefficients, and frame synchronization, in addition to the configuration of the experimental FFT scrambler. Possible causes for the degradation of the descrambled signal, such as transmission channel group delay and intersymbol interference, are also discussed, together with experimental results.
Keiichi Sakurai, Keiichiro Koga, Takuro Muratani
IEEE J. Sel. Areas Commun.2