Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 167 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 39 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 429 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Double Constacyclic Codes over Two Finite Commutative Chain Rings (2203.05301v1)

Published 10 Mar 2022 in cs.IT and math.IT

Abstract: Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as ${\Bbb Z}_2{\Bbb Z}_4$-additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good. In this paper we extend the study in two directions: we consider any two finite commutative chain rings with a surjective homomorphism from one to the other, and consider double constacyclic structures. We construct an extensive kind of double constacyclic codes over two finite commutative chain rings. And, developing a probabilistic method suitable for quasi-cyclic codes over fields, we prove that the double constacyclic codes over two finite commutative chain rings are asymptotically good.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.