مقاله

Some Optimal Codes From Designs

دانلود متن کاملرایگان، با حساب کاربری؛ ثبت نام با گوگل چند ثانیه است

چکیده(به انگلیسی؛ چکیده‌ی فارسی در دسترس نیست)

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

اسناد مشابه

  • some optimal codes from designs

    مقاله۲۰۱۱bulletin of the iranian mathematical societym. emami, ch. maysoori

    the binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. a new method is also introduced to study optimal codes.

  • Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks

    سند علمی۲۰۰۱Data Compression ConferenceQian Zhao, Michelle Effros

    A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}lm_, and {x}lm_, is drawn i.i.d. according to joint probability mass function (p.m.f.) p ( z , y); the encoder for each source op

  • Optimal Code Design for Multi-Wavelength OOC Optical CDMA system

    سند علمی۲۰۰۶C. Goursaud

    The objective of this work is to design optimal codes for a 2 Dimensional Optical Code Division Multiple Access system (2D-OCDMA), and to test their robustness to noise perturbation. 2D coding is performed by Multi-Wavelength Optical Orthogonal Codes (MWOOC). They are obtained wi

  • Some Optimal Codes as Tanner Codes with BCH Component Codes

    سند علمی۲۰۱۳Tom Høholdt, Fernando Piñero, Peng Zeng

    In this paper we study a class of graph codes with BCH component codes as affine variety codes. We are able to find some optimal binary and ternary codes as Tanner codes with BCH component codes. We choose a special subgraph of the point-line incidence plane of P(2, q) as the Tan

  • New bounds for n4(k, d) and classification of some optimal codes over GF(4)

    سند علمی۲۰۰۴Discrete MathematicsIliya Bouyukliev, Markus Grassl, Zlatko Varbanov

    Let n4(k; d) be the minimum length of a linear [n; k; d] code over GF(4) for given values of k and d. For codes of dimension "ve, we compute the exact values of n4(5; d) for 75 previously open cases. Additionally, we show that n4(6; 14)=24, n4(7; 9)=18, and n4(7; 10)=20. Moreover

  • Additive polycyclic codes over $ \mathbb{F}_{4} $ induced by binary vectors and some optimal codes

    مقاله‌ی دسترسی آزاد۲۰۲۲Advances in Mathematics of Communications['Arezoo Soufi Karbaski', 'Taher Abualrub', 'Nuh Aydin', 'Peihan Liu', '']

    In this paper, we study the structure and properties of additive right and left polycyclic codes induced by a binary vector \begin{document}$ a $\end{document} in \begin{document}$ \mathbb{F}_{2}^{n}. $\end{document} We find the generator polynomials and the cardinality of these