Performance of orthogonal CDMA codes for quasi-synchronous communication systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, the performance of quasi-synchronous direct-sequence CDMA communication systems based on different sets of orthogonal codes is investigated. The authors search for sets of sequences that minimize the probability of bit detection error, given that there is imperfect synchronization among the signals. Orthogonal sequences based on the Sylvester-type Hadamard matrices (Walsh functions) are shown to provide a large improvement over the case where an orthogonal set is chosen at random. For these sequences closed form expressions are derived for the average bit error rate. Computer searches indicate that this set of codes has special properties with respect to minimizing the average cross-correlations between the different signals for small errors in chip synchronization. It appears that these codes are optimal. A multi-carrier signalling scheme designed to help synchronize the CDMA signals at the chip level is also discussed.
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.
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.001 | 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.002 | 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 it