Polycyclic codes are a generalization of cyclic and constacyclic codes. Even though they have been known since 1972 received some attention more recently, there not many studies on polycyclic This paper presents an in-depth investigation associated with trinomials. Our results include number facts about trinomials, properties codes, new quantum derived from We also state several conjectures pol...

In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using construction rings from p-adic fields. Further propose a lattice linear codes.

Linear complementary dual (LCD) codes play an important role in data storage, communications systems and cryptography. In this paper, we construct some symplectic LCD from quasi-cyclic (QC) codes, prove that these with dimension two over \begin{document}$ \mathbb{F}_{2^a} $\end{document} are maximum-dista...

The puncturing and shortening technologies are two important approaches to construct new linear codes. It is noticed that many works on punctured codes have been done in the past few decades, but till now little research technique has there only a handful references shortened In this paper, we use technology obtain some from constructed by certain special defining s...

computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. this paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. there are syndromes...

for $q in {7,8,9,11,13,16}$, we consider the primitive actions of $l_2(q)$ and use key-moori method 1 as described in [codes, designs and graphs from the janko groups {$j_1$} and{$j_2$}, {em j. combin. math. combin. comput.}, {bf 40} (2002) 143--159., correction to: ``codes, designs and graphs from the janko groups{$j_1$} and {$j_2$}'' [j. combin. math. combin. comput. {bf 40} (2002) 143--159],...