Cyclotomic trace codes
Algorithms, ISSN: 1999-4893, Vol: 12, Issue: 8
2019
- 2Citations
- 54Usage
- 2Captures
- 1Mentions
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations2
- Citation Indexes2
- CrossRef2
- Usage54
- Downloads48
- Abstract Views6
- Captures2
- Readers2
- Mentions1
- Blog Mentions1
- 1
Most Recent Blog
Algorithms, Vol. 12, Pages 168: Cyclotomic Trace Codes
Algorithms, Vol. 12, Pages 168: Cyclotomic Trace Codes Algorithms doi: 10.3390/a12080168 Authors: Dean Crnković Andrea Švob Vladimir D. Tonchev A generalization of Ding’s construction is
Article Description
A generalization of Ding's construction is proposed that employs as a defining set the collection of the sth powers (s ≥ 2) of all nonzero elements in GF(p), where p ≥ 2 is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over GF(4) that give rise to optimal or near optimal quantum codes. In addition, the codes yield interesting combinatorial structures, such as strongly regular graphs and block designs.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85070565204&origin=inward; http://dx.doi.org/10.3390/a12080168; https://www.mdpi.com/1999-4893/12/8/168; https://digitalcommons.mtu.edu/michigantech-p/483; https://digitalcommons.mtu.edu/cgi/viewcontent.cgi?article=1480&context=michigantech-p; https://dx.doi.org/10.3390/a12080168
MDPI AG
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know