Results 281 to 290 of about 548,674 (315)
Some of the next articles are maybe not open access.

A code for \(m\)-bipartite edge-coloured graphs

2001
An \((n+1)\)-edge-colored graph is said to be \(m\)-bipartite if \(m\) is the largest integer so that every connected subgraph whose edges are colored by only \(m\) colors is bipartite. The authors assign a numerical code of length \((2n- m+1)\times q\) to each \(m\)-bipartite \((n+1)\)-edge-colored graph of order \(2q\).
CASALI, Maria Rita, GAGLIARDI, Carlo
openaire   +3 more sources

CNC Machine Programming Codes (G-Codes and M-codes)

2022
Pawan Kumar Negi   +2 more
openaire   +1 more source

Design of Polar Codes in 5G New Radio

IEEE Communications Surveys and Tutorials, 2021
Valerio Bioglio   +2 more
exaly  

Duality of Quantum and Classical Error Correction Codes: Design Principles and Examples

IEEE Communications Surveys and Tutorials, 2019
Zunaira Babar   +2 more
exaly  

Polar Codes and Their Quantum-Domain Counterparts

IEEE Communications Surveys and Tutorials, 2020
Zunaira Babar   +2 more
exaly  

Low-Density Parity-Check Codes and Their Rateless Relatives

IEEE Communications Surveys and Tutorials, 2011
Nicholas Bonello   +2 more
exaly  

On quasi-cyclic codes with rate \(1/m\)

IEEE Transactions on Information Theory, 1978
Summary: An integer linear programming problem and an additional divisibility condition are described such that they have a common solution if and only if there is a quasi-cyclic code with rate \(1/m\). A table of binary quasi-cyclic codes with dimensions seven and eight and rate \(1/m\) for small \(m\) is included.
openaire   +2 more sources

A Survey on Protograph LDPC Codes and Their Applications

IEEE Communications Surveys and Tutorials, 2015
Yi Fang, Guoan Bi, Yong Liang Guan
exaly  

A survey of error-correcting codes for channels with symbol synchronization errors

IEEE Communications Surveys and Tutorials, 2010
Hugues Mercier   +2 more
exaly  

Home - About - Disclaimer - Privacy