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

Brian C. Mortimer

dblp:293/9623 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none

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

Computer networks · 1 · 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 networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.011987
The Design of a High-Performance Error-Correcting Coding Scheme for the Canadian Broadcast Telidon System Based on Reed-Solomon Codes · IEEE Trans. Commun. 1987
Coding theory › error-correcting codes
reed-solomon codes
0.011987
The Design of a High-Performance Error-Correcting Coding Scheme for the Canadian Broadcast Telidon System Based on Reed-Solomon Codes · IEEE Trans. Commun. 1987
Internet architecture and protocols
teletext
0.011987
The Design of a High-Performance Error-Correcting Coding Scheme for the Canadian Broadcast Telidon System Based on Reed-Solomon Codes · IEEE Trans. Commun. 1987
YearPublicationVenuePosition
1987 The Design of a High-Performance Error-Correcting Coding Scheme for the Canadian Broadcast Telidon System Based on Reed-Solomon Codes
abstract
Error correction can greatly improve the performance and extend the range of broadcast teletext systems. In this paper, the requirements for an error-correcting scheme for broadcast teletext in North America (NABTS) are set down. An error-correction scheme which meets all these requirements is then described. The simplest case employs the one parity bit in each 8 bit byte and no suffix of parity check bits at the end of each data block. The next level also uses a single byte of parity check bits at the end of each data block. Adding a second byte of parity checks at the end of each data block results in a Reed-Solomon code, called theCcode, for each data block. Adding one data block of parity checks afterh - 1data blocks results in a set ofhdata packets being encoded into a bundle, in which verticalCcodes provide powerful interleaving. In a final alternative, two data blocks hold the check bytes for the vertical codewords, and the most powerful coding scheme, the double bundle code, results. The detailed mathematical definitions of the various codes are referred to or described, formulas for performance calculations are referred to, and performance curves are presented for the AWGN channel as well as for measured field data. These performance curves are discussed and compared to the performance of a difference set cyclic code, originally designed for the Japanese teletext system, which corrects any 8 bits in error in a packet.
Brian C. Mortimer, Michael J. Moore, Michael Sablatash
IEEE Trans. Commun.1