First Definitions and Basic Codes
نویسندگان
چکیده
منابع مشابه
Rank-Metric Codes and $q$-Polymatroids
We study some algebraic and combinatorial invariants of rank-metric codes, specifically generalized weights. We introduce q-polymatroids, the q-analogue of polymatroids, and develop their basic properties. We show that rank-metric codes give rise to q-polymatroids, and that several of their structural properties are captured by the associated combinatorial object. Introduction and Motivation Du...
متن کاملOn skew polynomial codes and lattices from quotients of cyclic division algebras
We propose a variation of Construction A of lattices from linear codes defined using the quotient Λ/pΛ of some order Λ inside a cyclic division F -algebra, for p a prime ideal of a number field F . To obtain codes over this quotient, we first give an isomorphism between Λ/pΛ and a ring of skew polynomials. We then discuss definitions and basic properties of skew polynomial codes, which are need...
متن کاملCumulative-Separable Codes
A t first Γ(L,G)-codes were introduced by V.D.Goppa [1] in 1970. These codes are a large and powerful class of error correcting codes. F.J. McWilliams and N.J. Sloane [2] defined these codes as the most important class of alternant codes. It is known that there are Γ(L,G)-codes that reach the Gilbert-Varshamov bound and that many Γ(L,G)-codes are placed in the Table of the best known codes [3]....
متن کاملDevising ethical codes for e-contents in e-learning
Background: Promoting ethics is one of the goals of education, but the free flow of communication and divulging unethical behaviors in e-learning make the urgent need to clarify ethical values. Therefore, the aim of this study was to prepare ethical codes to develop and deliver e-contents. Methods: A draft of e-content ethical codes was prepared based on the literature review. Then, it was ...
متن کاملAlgorithmic Issues in Coding Theory
The goal of this article is to provide a gentle introduction to the basic definitions, goals and constructions in coding theory. In particular we focus on the algorithmic tasks tackled by the theory. We describe some of the classical algebraic constructions of error-correcting codes including the Hamming code, the Hadamard code and the Reed Solomon code. We describe simple proofs of their error...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017