Thesis

bch-جبر و بررسی n-ساختارهای آن

Download full textFree with an account; signing up with Google takes seconds

Abstract(in Persian; no English abstract is available)

در این پایان نامه bch-جبر و زیرجبرهای مهم آن از جمله bci/bck-جبر و بخش میانی را معرفی کردهو ارتباط آنها با بخش مثبت بررسی میشود همچنین تجزیه bch-جبرها به کمک بخش میانی مورد بررسی قرار می گیرد در ادامه به معرفی رابطه همنهشتی روی bch-جبر پرداخته شده و شرایط ساخت bch-جبر خازج قسمتی مورد مطالعه قرار میگیرد. در پایان با معرفی زیر مجموعه های فازی n-ساختار معرفی شده و به مطالعه n-ساختارهای روی bch-جبر پرداخته می شود. همچنین شرایط تولید یک n-ایده ال بسته توسط یک n-زیرجبر بررسی میشود.

Supervisors and advisors

محمدعلی نصر آزادانی

Similar items

  • Maximum-likelihood soft decision decoding of BCH codes

    Scholarly record1994IEEE Trans. Information TheoryAlexander Vardy, Yair Be'ery

    The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several id

  • On Sub-implicative (α, Β)-fuzzy Ideals of Bch-algebras

    Scholarly record2014MUHAMMAD ZULFIQAR

    The theory of fuzzy sets, which was initiated by Zadeh in his seminal paper [33] in 1965, was applied to generalize some of the basic concepts of algebra. The fuzzy algebraic structures play a vital role in mathematics with wide applications in many other branches such as theoret

  • ON THE DESIGN OF BCH CODES POLYNOMIALS FOR DIGITAL TELEVISION DVB-T2 BROADCASTING SYSTEMS

    Open-access article2020Journal of Measurements, Electronics, Communications, and SystemsHilman AuzanMulyono, KhoirulAnwar, BudiPrasetya

    Digital Video Broadcasting Terrestrial{Second Generation (DVB-T2) requires a high coding rate to transmit data of high-quality video. This paper evaluates Bose-Chaudhuri-Hocquenghem (BCH) codes for the DVB-T2 to measure the gain of BCH codes. This paper evaluates the BCH codes as

  • Ternary Bose - Chaudhuri - Hocquenghem (BCH) with t = 2 code for steganography

    Open-access article2016Journal of Digital Contents SocietyVasilySachnev, Yong SooChoi

    본 논문에서는 t = 2인 3진 BCH 코드를 기반으로 하는 새로운 스테가노그라피 방법을 제시한다. 제안 된 방법에서는 JPEG 영상으로부터 추출된 DCT 계수들에 데이터 은닉을 하기 위해 t = 2인 강력한 BCH 코드를 사용하였다. 제안하는 데이터 은닉 기술은 삼진 BCH 코드(t=2인 경우)에서 다양한 해결책을 찾기 위한 접근으로 제안된 룩업테이블을 사용하였다. 고안된 룩업 테이블 접근법은 데이터 은닉을 위해 수정이 필요한 DCT 계수들의 위치를 빠르고 효율적으로 연산 가능하게 하였다. 제시

  • Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations

    Scholarly record1991IEEE Trans. Information TheoryGui Liang Feng, Kenneth K. Tzeng

    The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm and our generalizations of these algorithms, are basically constrained by the minimum distance bounds of the codes. Thus, when the actual minimum distance of the code

  • A Class of Narrow-Sense BCH Codes

    Open-access article2019IEEE Transactions on Information TheoryShixinZhu, ZhonghuaSun, XiaoshanKai

    BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes. Recently, Ding et al. ma