MétaCan
Menu
Back to cohort
Record W4387217179 · doi:10.59697/jik.v5i1.314

IMPLEMENTATION OF THE HAMMING CODE METHOD IN BIT DATA IMPROVEMENT TRANSMISSION PROCESS

2021· article· id· W4387217179 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJurnal Informatika Kaputama (JIK) · 2021
Typearticle
Languageid
FieldComputer Science
TopicInformation Retrieval and Data Mining
Canadian institutionsKootenay Association for Science & Technology
Fundersnot available
KeywordsHamming codeComputer sciencePhysicsAlgorithmDecoding methodsBlock code

Abstract

fetched live from OpenAlex

Dalam sistem komunikasi, keberhasilan penyampaian informasi dari pengirim (transmitter) kepada penerima (receiver) tergantung pada seberapa akurat penerima dapat menerima sinyal yang ditransmisikan dengan baik dan benar. Nyatanya sinyal informasi yang diterima masih banyak terdapat kesalahan sehingga diperoleh data corrupt (bit error) yang disebabkan oleh noise (sinyal pengganggu) ketika proses pengiriman data sehingga menyebabkan file tersebut tidak bisa dibaca. Maka dari itu diperlukan teknologi untuk memperbaiki kesalahan pada bit error tersebut, yaitu menggunakan metode hamming code. Hamming code merupakan salah satu jenis linier error correcting code yang sederhana dan banyak digunakan pada peralatan elektronik. Metode hamming code bekerja dengan menyisipkan beberapa buah check bit ke data. Jumlah check bit yang di sisipkan tergantung pada panjang data. Hamming code menggunakan operasi Ex-OR (Exclusive OR) dalam proses pendeteksian maupun proses pengkoreksian error.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0010.007
Open science0.0030.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.040
GPT teacher head0.356
Teacher spread0.316 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it