|
|
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？
- u9 r* m3 {3 v) F! WEncoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity; N2 c, p& }- x( e/ E$ ]8 k
Yi Kuang;. `; e3 J5 b& N% z; J! Y, W3 C1 Y$ t
Songsong Li;
( v2 a u! E! zShu Liu;) Q1 a& o; b3 @9 P5 ~: S
Liming Ma;
3 ^9 \2 j8 c# QChaoping Xing1 I. ^/ ^8 s% F# @+ y6 s/ a' M
IEEE Transactions on Information Theory
?5 n+ c E& ~' N' `0 sYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE d- g' K3 [4 u9 ?$ V
! s: r" ?! r/ \) R0 e8 |Abstract
1 X" M1 `$ p4 b4 @' K! n! l; YHTML
R2 Y: o+ z. J5 s8 S1 _- P- i( {5 v$ u
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
8 [# ?4 E1 }. u7 e# y1 b- tSongsong Li;
! D; w5 Q! Y: }$ H) lShu Liu;
$ }4 v- k: A( j8 ` ^Liming Ma;5 `% p2 ~- a N t& A$ ~8 t+ ^
Yunqi Wan;1 @1 T @3 z% [1 K; m1 n& h- ?- X
Chaoping Xing
: t, b; e; C& D5 j# `$ ^IEEE Transactions on Information Theory
# o/ \ I( m$ ^, wYear: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE$ P$ W1 T& X2 K
+ |0 {7 M% a% I+ e; l
Abstract- ^+ \" F& D/ [) Y
HTML
2 V5 [) \) ?9 P3 B: A! b8 K" w3 `* p
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
# n% c0 M$ F9 W+ n3 VShu Liu;
5 T l. V+ @: u/ x* ~ I! a0 ~Ivan Tjuawinata;
$ C9 `7 T: g; EChaoping Xing
+ H8 X! ]! Y3 R/ F, \# I8 y# Q1 y5 WIEEE Transactions on Information Theory% \% ~+ S4 K* o
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE3 n! U6 m# h/ ]6 q0 E3 f
Cited by: Papers (4)
7 B7 o6 d/ R$ }2 b- j
: G. I f1 @: m) ?8 b: WAbstract
8 K# O) I( ^3 h6 W- h- HHTML
# r; K$ J9 m1 ] k% X- s2 M5 D3 ^' L
- z4 O$ o5 A, qA Lower Bound on the List-Decodability of Insdel Codes$ X3 `8 a8 r7 r5 w5 v6 @
Shu Liu;" e8 ^4 K) c. V
Ivan Tjuawinata;) {0 f# j7 t, N5 H1 o, ?# X# c1 F$ V
Chaoping Xing" k- t% S7 |9 R3 ~# j2 P+ L
IEEE Transactions on Information Theory
1 u- P, B/ _2 a1 Y) zYear: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
- X3 d" l! b: v! [1 h r3 L
0 Y! @9 D* l2 wAbstract
, w V/ ~/ i# LHTML. ^+ Y' R4 @" ~1 F! S4 N( y
- l$ s7 m) |& O4 G0 o1 \A New Construction of Nonlinear Codes via Algebraic Function Fields
0 b' r3 K5 G; a2 Z! Y4 W: oShu Liu;
# H# ~1 U! @/ z+ j+ e" M4 E, j" zLiming Ma;0 y* R f$ V9 T2 L& h: @
Ting-Yi Wu;2 \/ Y" @2 { Y4 \2 q: `' C
Chaoping Xing- ?( `( k y) c& \
IEEE Transactions on Information Theory
; l% l$ f p% z2 M5 Y) jYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE6 {6 }* P9 L) {9 F. s0 D
Cited by: Papers (1)
/ P) g6 m9 Q4 o$ L* B' D* w" t9 E" T+ U1 u" p
Abstract
# {8 W9 |7 ~" b; e: x8 THTML+ A9 U8 _# J! Q, U
/ \, r' S. O* k- ^Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
0 r0 i( V/ ^8 d2 Q" K6 Y0 v& \* xShu Liu;! Y6 j6 l7 w4 S7 E# A
Chaoping Xing
% B: c% q- j$ p8 k; T$ k5 h3 _IEEE Transactions on Information Theory6 c7 Y+ ^6 n8 n/ ?2 `& s" r3 |
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
~; {9 U- ~; t4 ~Cited by: Papers (2)
5 c k# x5 \# E5 z' S p; |: A
1 r2 Z3 U- G8 q6 `1 ~$ o9 ~7 r& uAbstract0 `" ], y! w$ c6 j% @+ f
HTML
h' d1 \+ \" D5 L0 |0 {( Q' k5 e6 c2 A R+ s7 `
Bounds and Constructions for Insertion and Deletion Codes( i$ t1 B9 ? j8 ^& J a
Shu Liu;8 A& C1 m. |/ ~& Z# H
Chaoping Xing0 {" X1 b1 S) ~, e/ R+ r/ h
IEEE Transactions on Information Theory
" ]- C8 h! I* t/ m1 FYear: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
' i( G$ K; P7 J. |) [Cited by: Papers (14)3 x2 E: o* _( t5 b1 z
3 _, f5 C8 b7 Z" A7 kAbstract% U" z% R1 h' [( {
HTML
u/ h/ ` e( f0 q5 @& K- u |. j
# s+ u" s* \5 P% P3 i* rEfficiently List-Decodable Insertion and Deletion Codes via Concatenation
+ D3 j3 K- z4 A* IShu Liu;
2 L- S! O8 K2 r6 {5 m0 m5 r# Y/ W RIvan Tjuawinata;
' ?) T, W* g5 c. _6 {2 M4 P# @) VChaoping Xing: Z9 i( V& C$ ~$ W
IEEE Transactions on Information Theory
, _* }- s1 Z3 DYear: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
6 f& H) L) v# x6 j9 qCited by: Papers (6)1 _+ F, m0 Q9 H% j. p' g
9 A* P' ^2 l# d; |
Abstract$ G/ ]0 c$ P1 f$ U+ m M5 m
HTML
0 p* m: \: r4 y
5 _2 P" t8 ?5 V5 m' u- rExplicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime/ _/ i: E5 @- ]! ]
Tai Do Duc;
% X+ k( G4 D& i" c. s/ @0 {Shu Liu;) v# c. Z W1 X% |# k, F; Y# |
Ivan Tjuawinata;
5 A7 b9 F6 I# o, pChaoping Xing9 w1 E( S$ q: g6 h
IEEE Transactions on Information Theory5 x, v" w* X; K: j
Year: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE2 ?: w, w4 u* N4 H- b; @$ q; [% K
Cited by: Papers (17)# G4 `& R% Z4 ~2 C' I
% }" j+ E) ~8 d6 N) U" k
Abstract
' R9 w6 ?6 W# a0 ^$ A$ W2 aHTML% x% ~& _$ k' x1 t& m; _- x
8 F- x! ?7 O5 Y$ d# R' J2 G- vList Decodability of Symbol-Pair Codes. h* D# E- `! S" m, m& X& ?
Shu Liu;
( w- A+ s) }6 g# {" lChaoping Xing;
6 ~" ]0 L; ]/ G$ W* K# CChen Yuan: Z& f0 J0 ~. k; @, G* p* x
IEEE Transactions on Information Theory
+ b. q0 v Z5 o% R# K3 j2 {6 y0 NYear: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
! N1 F; F5 M% {5 ~( {& lCited by: Papers (15)% j: U& Y1 O. s) N" ^
) }; F. ?& J: E2 L5 ?; I
Abstract$ l7 O7 _- x8 Q8 d2 {. A1 W9 u
HTML8 S2 k" B9 p5 f0 Q; }3 z
# e1 `! y; t- m: S, A( OList Decoding of Cover Metric Codes Up to the Singleton Bound
$ f7 n' j. Q+ m3 m3 [: ?% eShu Liu;1 h6 R) p3 @) u- S0 J# v/ k- b
Chaoping Xing;7 y! M/ w9 h9 V
Chen Yuan) d/ R! ^% T( e2 |& D
IEEE Transactions on Information Theory5 ~9 ?6 A d" P. L1 B0 p/ Y" y
Year: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE
/ [+ M% v* V p( d0 p! w8 WCited by: Papers (7)/ Q: j4 ]9 R1 ]/ S; A9 x% A, o ]; F
8 t/ k6 F1 U4 \ k h0 X
Abstract
. j) c6 C$ o" [% rHTML
0 c0 d2 S8 d4 ?$ X2 M) g3 |8 p! ~3 r3 S* j4 N- x
List Decodability of Random Subcodes of Gabidulin Codes
8 Z) E% v4 W; P3 Q. o$ h7 _0 PShu Liu;0 V2 k( H1 |) A: a( p2 Z, o
Chaoping Xing;
2 w! T. Y, Y' mChen Yuan
+ n' _7 m- r" v8 kIEEE Transactions on Information Theory
5 M; ~# j% b c; uYear: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
- i4 H" _0 D+ R$ `3 ~6 O' [* lCited by: Papers (5)! B2 Q$ U- D/ y2 |/ t
|
|
[复制链接]
发表于 
楼主
发表于 