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

Stanley Wainberg

dblp:12/3219 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 4 · 4 first-authorComputer networks · 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
Optical networks · 77% Network optimization and economics · 23%
Theoretical computer science
4 papers
Coding theory · 90% Information theory · 10%

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

TopicWeightPapersLastEvidence papers
Optical networks › network survivability
self-healing ring
0.011994
Deployment issues of CCS links on self-healing rings · IEEE J. Sel. Areas Commun. 1994
Network optimization and economics › network design
network planning
0.011994
Deployment issues of CCS links on self-healing rings · IEEE J. Sel. Areas Commun. 1994
Coding theory › error-correcting codes › decoding
algebraic decoding
0.011973
Algebraic Decoding of Block Codes over a q-ary Input, Q-ary Output Channel, Q>q · Inf. Control. 1973
Coding theory › error-correcting codes › block codes
binary block codes
0.011972
Burst decoding of binary block codes on Q -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes
burst error correction
0.011972
Burst-error and random-error correction over q -ary input, p -ary output channels (Ph.D. Thesis abstr.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
burst-error decoding
0.011972
Burst decoding of binary block codes on Q -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › decoding › decoding algorithms
decoding of block codes
0.011973
Algebraic Decoding of Block Codes over a q-ary Input, Q-ary Output Channel, Q>q · Inf. Control. 1973
Coding theory
error-correcting codes
0.011972
Burst-error and random-error correction over q -ary input, p -ary output channels (Ph.D. Thesis abstr.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › decoding
errors-and-erasures decoding
0.011972
Error-erasure decoding of product codes (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › block codes
product codes
0.011972
Error-erasure decoding of product codes (Corresp.) · IEEE Trans. Inf. Theory 1972
Information theory › communication channels › channel models
q-ary output channels
0.011972
Burst decoding of binary block codes on Q -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › error detection and correction
random error correction
0.011972
Burst-error and random-error correction over q -ary input, p -ary output channels (Ph.D. Thesis abstr.) · IEEE Trans. Inf. Theory 1972

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

weighted erasure decoding · 0.0majority-logic decoding · 0.0component code decoding · 0.0
YearPublicationVenuePosition
1994 Deployment issues of CCS links on self-healing rings
abstract
Fiber-based self-healing rings (SHRs) are being deployed for trunking purposes for voice/data/video services because of their high reliability and survivability. To reduce deployment and maintenance costs of provisioning different facilities for these services and common channel signaling (CCS) networks, network planners have begun to deploy CCS network signaling links on SHRs. This paper examines some issues of deploying A/B/C/D link sets on SHRs.>
Alexander T. Leung, Stanley Wainberg
IEEE J. Sel. Areas Commun.2
1973 Algebraic Decoding of Block Codes over a q-ary Input, Q-ary Output Channel, Q>q
Stanley Wainberg, Jack K. Wolf
Inf. Control.1
1972 Burst-error and random-error correction over q -ary input, p -ary output channels (Ph.D. Thesis abstr.)
Stanley Wainberg
IEEE Trans. Inf. Theory1
1972 Error-erasure decoding of product codes (Corresp.)
abstract
Two error-erasure decoding algorithms for product codes that correct all the error-erasure patterns guaranteed correctable by the minimum Hamming distance of the product code are given. The first algorithm works when at least one of the component codes is majority-logic decodable. The second algorithm works for any product code. Both algorithms use the decoders of the component codes.
Stanley Wainberg
IEEE Trans. Inf. Theory1
1972 Burst decoding of binary block codes on Q -ary output channels (Corresp.)
abstract
The burst-bdistance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input,Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's [2] weighted erasure decoding. Examples are presented illustrating the techniques.
Stanley Wainberg, Jack K. Wolf
IEEE Trans. Inf. Theory1