Forward error correction for the synchronous optical network (SONET) signal standard
Bibliographic record
Abstract
The design, feasibility, performance, and implementation of a single-error correcting code, applicable to the STS-1 format of the SONET standard, are considered. It is shown that if two of the presently unallocated bytes in the path overhead field of STS-1 are assigned for FEC (forward error correction), an optional (6208,6195) shortened Hamming code can be implemented in as few as 16500 gates, achieving single-error correction over the STS-1 payload. The shortened code is derived from (8191,8178) perfect Hamming code having 13 check bits. The suggested implementation is such that all path, line, and section overhead functions can be performed at intermediate sites without requiring FEC decoding. The motivation for STS-1 level FEC in SONET is to improve end-to-end performance to virtually error-free levels, to obtain relaxations in laser specifications, and improved dispersion tolerance in gigabit-rate OC-n transmission systems, and to obtain an advanced performance monitoring function. >
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".