Which Codes Have Cycle-Free Tanner Graphs?

IEEE Transactions on Information Theory - United States
doi 10.1109/18.782170
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Elusive Codes in Hamming Graphs

Bulletin of the Australian Mathematical Society
Mathematics
2013English

Disjoint Identifying-Codes for Arbitrary Graphs

2005English

Searching Cycle-Disjoint Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Triangle-Free Planar Graphs as Segments Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Continua Which Have Width Zero

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1962English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Hamiltonian Cycle in Complete Multipartite Graphs

Annals of Pure and Applied Mathematics
2017English

Coloring Square-Free Berge Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Perfect Codes in the Graphs Ok and L(Ok)

Glasgow Mathematical Journal
Mathematics
1980English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy