DSRC 4
DSRC 4
3 Problems
Md Ajaharul Hossain October 22, 2024
Conclusion
4 Roll and Future Scope
No 195050102 DSRC 4
1 Guenda, K., Gulliver, T.A., Jitman, S. et al. Linear l-intersection pairs of codes and their
applications, Des. Codes Cryptogr. 88, 133–152 (2020).
Dr. Shyama Prasad Mukherjee
2 Liu, J. and Liu, X. l-LCP of codes and their applications to EAQEC codes, Quantum Infor-
Naya Raipur
IEEE Trans. Inf. Theory 44 (1998) 1369-1387
4 T. Abualrub, S. T. Dougherty, Additive and linear conjucyclic codes over F , Advances in
4
Mathematics of Communications (2020).
5 M. Esmaeili and S. Yari, On complementary-dual quasi-cyclic codes, Finite Fields and Their
Applications, vol. 15, no. 3, pp. 375–386, 2009.
International Institute of Information Technology Naya Raipur 3 / 26
Outline
3 Problems
Md Ajaharul Hossain October 22, 2024
Conclusion
4 Roll and Future Scope
No 195050102 DSRC 4
3 Problems
Md Ajaharul Hossain October 22, 2024
Conclusion
4 Roll and Future Scope
No 195050102 DSRC 4
Contributions
1. A necessary and sufficient condition for additive complemen-
tary dual.
Md Ajaharul Hossain October 22, 2024
2. Trace hull and
Roll No 195050102 its dimension for an ACC code over F44 .
DSRC
3. Find trace codes from ACC codes and observe that such
codes have good parameters.
Dr. Shyama Prasad Mukherjee
4. The application of Institute
International trace codes of ACC Technology
of Information codes to EAQEC
codes. Naya Raipur
∗ Accepted in the Journal of Advances in Mathematics of Communications
(ω 2 , ω , 0, ω , 0, 0, 0, 0, 0, 0, 0, 0, ω 2 , ω , 0, ω ,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, [[43, 28, 6; 15]] [[43, 27, 4; 15]] [7]
5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)
Dr. Shyama Prasad Mukherjee
(ω 2 , 0, ω , ω 2 , 0, 0, 0, 0, ω 2 , ω 2 , ω 2 , 0, 0, 0,
ω , ω , 0, 0, 0, ω 2 , ω 2 , ω 2 , 0, 0, 0, 0, ω , ω , 0, ω 2
[[43, 15, 13; 28]] [[43, 15, 9; 28]] [7]
6
International Institute of Information Technology
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)
Naya Raipur
6 L. Lu, R. Li, L. Guo, and Q. Fu, Maximal entanglement entanglement-assisted quantum codes
constructed from linear codes, Quantum Information Processing, vol. 14, no. 1, pp. 165–182,
2015.
7 X. Liu, L. Yu, and P. Hu, New entanglement-assisted quantum codes from k-galois dual codes,
Finite Fields and Their Applications, vol. 55, pp. 21–32, 2019.
International Institute of Information Technology Naya Raipur 9 / 26
Problem 2 ∗
Contributions
1. Characterization of `-intersection pair of λi -constacyclic
codes and obtain a condition for `-LCP.
Md October 22,
Ajaharul Hossain of `-intersection pair of conjucyclic
2. Characterization 2024
codes
Rollover
No 195050102
F 2. DSRC 4
p
3. The largest Fp -subcode of an ACC code over Fp2 is cyclic
and obtains its generating
Dr. Shyama polynomial.
Prasad Mukherjee
International
4. Determine Institute
`-intersection of Information
pairs Technology
of trace codes of ACC codes
Naya
over F4 . Raipur
∗ Under review in Discrete Mathematics.
International Institute of Information Technology Naya Raipur 10 / 26
Problem 3 ∗
Contributions
1. Proposed a VMSS scheme based on an `-intersection pair of
Md cyclic
Ajaharul Hossain
codes. October 22, 2024
Roll No 195050102 DSRC 4
2. Architect the scheme with Cheater detection and identifica-
tion mechanism.
Dr. Shyama Prasad Mukherjee
3. Focus on security analysis and performance comparison.
International Institute of Information Technology
∗ Published inNaya Raipur
the International Journal of Foundation of Computer Science.
8 H. Y. Chien, J. K. Jan, and Y. M. Tseng, practical (t, n) multi-secret sharing scheme, IEICE
Dr. Shyama Prasad Mukherjee
transactions on fundamentals of electronics, communications, and computer sciences, vol. 83,
no. 12, pp. 2762–2765, 2000.
International Institute of Information Technology
9 C. C. Yang, T. Y. Chang, and M. S. Hwang, A (t, n) multi-secret sharing scheme, Applied
Mathematics and Computation, vol. 151, no. 2, pp. 483–490, 2004.
Naya Raipur
10 L. J. Pang and Y. M. Wang, A new (t, n) multi-secret sharing scheme based on Shamir’s secret
sharing, Applied Mathematics and Computation, vol. 167, no. 2, pp. 840–848, 2005.
11 J. Shao, Efficient verifiable multi-secret sharing scheme based on hash function, Information
Sciences, vol. 278, pp. 104–109, 2014.
Contributions
1. Proposed a secret sharing scheme based on `-intersection
Md pair
Ajaharul Hossain
of cyclic October a22,
codes that are used in re-constructing 2024
secret
Rollkey
No to verify a transaction in a blockchain. DSRC 4
195050102
3 Problems
Md Ajaharul Hossain October 22, 2024
Conclusion
4 Roll and Future Scope
No 195050102 DSRC 4
3 Problems
Md Ajaharul Hossain October 22, 2024
Conclusion
4 Roll and Future Scope
No 195050102 DSRC 4
A study
Thesis titleon linear complementary
(Tentative): pairs of codes
A study on linear complementary pairs
of over
codes over a finite
a finite fieldand
field and their
theirgeneralizations.
generalizations
(Supervisor: Dr. 5:
Table Ramakrishna Bandi, Assistant
Thesis chapterization Professor)
(Tentative)
3 Problems
Md Ajaharul Hossain October 22, 2024
Conclusion
4 Roll and Future Scope
No 195050102 DSRC 4
MdM.Ajaharul
A. Hossain and R. Bandi, ”`-LCP of Fq -linearOctober
Hossain codes over m ”.
22,Fq2024
Under preparation
Roll No 195050102 DSRC 4
M. A. Hossain and R. Bandi, ”A secret sharing scheme based on
`-intersection pair of codes in block-chain”. Under preparation
Dr. Shyama Prasad Mukherjee
International Institute of Information Technology
Naya Raipur
Thank You
(Supervisor: Dr. Ramakrishna Bandi, Assistant Professor)