MétaCan
Menu
Back to cohort
Record W2146198330 · doi:10.1109/tit.2011.2146350

Feedback Capacity of a Class of Symmetric Finite-State Markov Channels

2011· article· en· W2146198330 on OpenAlexaff
Nevroz Şen, Fady Alajaji, Serdar Yüksel

Bibliographic record

VenueIEEE Transactions on Information Theory · 2011
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsQueen's University
FundersInternational Federation of Automatic Control
KeywordsFinite stateMarkov processMarkov chainEntropy (arrow of time)MathematicsChannel capacityChannel (broadcasting)Symmetry (geometry)Function (biology)Noise (video)Class (philosophy)Finite setTopology (electrical circuits)Applied mathematicsStatistical physicsDiscrete mathematicsControl theory (sociology)Computer scienceCombinatoricsMathematical analysisTelecommunicationsPhysicsStatisticsQuantum mechanics

Abstract

fetched live from OpenAlex

We consider the feedback capacity of a class of symmetric finite-state Markov channels. Here, symmetry (termed “quasi-symmetry”) is defined as a generalized version of the symmetry defined for discrete memoryless channels. The symmetry yields the existence of a hidden Markov noise process that depends on the channel's state process and facilitates the channel description as a function of input and noise, where the function satisfies a desirable invertibility property. We show that feedback does not increase capacity for such class of finite-state channels and that both their nonfeedback and feedback capacities are achieved by an independent and uniformly distributed (i.u.d.) input. As a result, the channel capacity is explicitly given as a difference of output and noise entropy rates, where the output is driven by the i.u.d. input.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.021
GPT teacher head0.209
Teacher spread0.188 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Quick stats

Citations17
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Information TheorySame topicWireless Communication Security TechniquesFrench-language works237,207