"Bounds on Covering Radius of F2R-Linear Codes"

LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over $\mathbb {F}_{2}R$ with respect to the Chinese Euclidean distance. Click to show full abstract

In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over $\mathbb {F}_{2}R$ with respect to the Chinese Euclidean distance.

Keywords: linear codes; bounds covering; radius f2r; covering radius; f2r linear

Journal Title: IEEE Communications Letters
Year Published: 2021

Link to full text (if available)

Share on Social Media: Sign Up to like & get
recommendations!
1

LAUSR

You are not signed in:

Sign Up!

Related content

More Information News Social Media Video Recommended