Results 261 to 270 of about 103,237 (307)

Maternal Genetic Variants and Gestational Duration: A Replication Study in a Japanese Cohort. [PDF]

J Clin Med
Tanabu R, Iino K, Sato M, Nakamura M, Yokoyama M, Tamada Y, Itoh K, Mikami T, Murashita K, Yokoyama Y.   +9 more
europepmc   +1 more source

Modeling the Association between Repeated Measures of Hemoglobin during Pregnancy and Adverse Birth Outcomes. [PDF]

J Nutr
Geng J, Zhang Z, Nguyen PH, Luo H, Young MF, Ko YA.   +5 more
europepmc   +1 more source

Binary codes of strongly regular graphs.

Peeters, M.J.P., Haemers, W.H., Rijckevorsel, J.M. van   +2 more
core  

New $[47,15,16]$ Linear Binary Block Code [PDF]

IEEE Transactions on Information Theory, 2008
A new [47,15,16] linear binary block code and its weight spectrum is presented. The code is better than the previously known [47,15,16] code and it reaches the upper bound on code distance for the codeword length 47 and dimension 15.The authors would ...
Peter Farkaš, Ana Garcia Armada
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the intersection of binary linear codes

Journal of Systems Science and Complexity, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dajian Liao, Zihui Liu
openaire   +2 more sources

Binary Linear Codes With Two Weights

IEEE Communications Letters, 2015
Linear codes have wide applications in secret sharing schemes and authentication codes. In this letter, a class of binary linear codes with two weights is presented. The weight distribution of this class of binary linear codes is settled. The dual codes are also studied and proved to be optimal or almost optimal.
Qiuyan Wang, Rui Xue
exaly   +2 more sources

On the Coding Gain of Linear Binary Block Codes

IEEE Transactions on Communications, 1984
The coding gain of linear binary block codes on the AWGN channel is studied. Antipodal signaling and hard decision demodulation are assumed. Simple asymptotic expressions for the gain at high and low energy to noise spectral density ratios are derived. Monotonicity of the coding gain is also discussed.
Vladan M. Jovanovic, Srdjan Z. Budisin
openaire   +1 more source

Valid inequalities for binary linear codes

2009 IEEE International Symposium on Information Theory, 2009
We study an integer programming (IP) based separation approach to find the maximum likelihood (ML) codeword for binary linear codes. An algorithm introduced in Tanatmis et al. is extended and improved with respect to decoding performance without increasing the worst case complexity. This is demonstrated on the LDPC and the BCH code classes.
Stefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn, Mayur Punekar   +5 more
openaire   +1 more source