Constructions and bounds on linear error-block codes
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over . We also study the asymptotic of linear er...
Saved in:
Main Authors: | Ling, San, Özbudak, Ferruh |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96410 http://hdl.handle.net/10220/9851 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On secret sharing schemes and linear codes
by: Romar Basillaje Dela Cruz
Published: (2013) -
An explicit class of codes with good parameters and their duals
by: Özbudak, Ferruh, et al.
Published: (2013) -
Some constructions of (t, m, s)-nets with improved parameters
by: Ling, San, et al.
Published: (2013) -
Optimising implementation of block ciphers
by: Tan, Quan Quan
Published: (2019) -
Analysis of iterated block ciphers
by: Wei, Lei
Published: (2012)